Moving picture coding device, moving picture coding method, and moving picture coding program, and moving picture decoding device, moving picture decoding method, and moving picture decoding program

ABSTRACT

In a moving picture coding device that further divides a first block acquired by dividing each picture of a moving picture into a predetermined size into one or a plurality of second blocks and codes the moving picture in units of blocks, a quantization parameter calculation unit calculates a quantization parameter of the second block. A predictive quantization parameter deriving unit derives a predictive quantization parameter of the second block by using the quantization parameter of one or a plurality of third blocks that are neighboring to the second block. The predictive quantization parameter deriving unit derives the predictive quantization parameter of the second block by using a quantization parameter of a fourth block coded before the second block in a case where the third block neighboring to the second block is located at a position beyond a boundary of the first block.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No.14/296,032, filed Jun. 4, 2014, which is a Continuation of InternationalApplication No. PCT/JP2012/008199, filed Dec. 21, 2012, which claims thebenefit of Japanese Patent Application Nos. 2011-280220 and 2011-280221,filed Dec. 21, 2011, and 2012-279014 and 2012-279015, filed Dec. 21,2012.

BACKGROUND

The present invention relates to moving picture coding and decodingtechnologies, and more particularly, to moving picture coding anddecoding technologies using predictive coding of quantizationparameters.

In digital moving picture coding according to MPEG-2 Part 2(hereinafter, referred to as MPEG-2), MPEG-4 Part 10/H. 264(hereinafter, referred to as AVC), or the like, a picture is dividedinto blocks of a predetermined size and is coded, and a quantizationparameter that represents the roughness of the quantization with respectto a predictive error signal (or simply referred to as a picture signal)is transmitted. On the coding side, by performing variation control ofthe quantization parameter in units of predetermined blocks, the amountof coding can be controlled, and the subject picture quality can beimproved.

As control of the quantization parameter for improving the subjectivepicture quality, adaptive quantization is frequently used. In theadaptive quantization, the quantization parameter is changed inaccordance with the activity of each block such that fine quantizationis performed for a flat portion in which deterioration is more easilynoticeable visually, and rough quantization is performed for a complexpattern portion in which deterioration is not easily noticeablevisually. In other words, the quantization parameter is changed suchthat a large quantization scale is set in a macro block having a highactivity level in which the amount of assigned bits after coding may beeasily increased. As a result, the subjective picture quality isimproved while the number of bits of coded picture data is controlled tobe as small as possible.

According to the MPEG-2, it is determined whether or not thequantization parameter of a previous block in the sequence ofcoding/decoding and the quantization parameter of a coding target blockare the same. In a case where the quantization parameters are not thesame, the quantization parameters are transmitted. Meanwhile, accordingto the AVC, differential coding of the quantization parameter of acoding target block is performed by using as a prediction value thequantization parameter of the previous block in the sequence ofcoding/decoding. The reason for this is that, generally, since thecoding amount control is performed in the coding sequence, thequantization parameter of the previous block in the coding sequencetends to be closest to the quantization parameter of the coding block,and this is for suppressing the information amount of the quantizationparameter to be transmitted.

Japanese Patent Application Laid-Open No. 2011-91772

In a conventional control process of the quantization parameter, adifference between the quantization parameter of a coding target blockand the quantization parameter of a coded block, which is disposed onthe left side thereof, serving as a predictive quantization parameter iscalculated, and the calculated differential quantization parameter iscoded, whereby the coding amount of the quantization parameter isdecreased. However, depending on the content within the screen, forexample, as illustrated in FIG. 8, in a case where the characteristic ofa picture disposed inside the coding target block and the characteristicof a picture disposed inside a left block, which has been coded, aredifferent from each other, a difference between the quantizationparameters that are calculated by the adaptive quantization process islarge, and accordingly, even when a prediction of a quantizationparameter in relation with the left block is uniquely made, thedifferential quantization parameter is large, whereby there is a problemthat the coding amount increases.

In addition, since the quantization parameter calculated in the codingamount control process is acquired in the raster scanning order from theupper left side to the lower right side of a normal screen, when theblock size of the coding target is small, the processing sequencebetween slices is separated away. Accordingly, in a case where thequantization parameter of a coded block that is neighboring to the upperside of the coding target block is used for a prediction of the codingtarget block, although the upper block is neighboring to the codingtarget block, the processing sequence in the coding amount controlprocess is separate from each other, and accordingly, there is noprobability that the quantization parameter calculated in the codingamount control process necessarily has the same value or a close valuebetween the coding target block and the coded block neighboring to theupper side. Therefore, there is a problem in that the coding amount ofthe differential quantization parameter cannot be determined to bereduced.

SUMMARY

The present invention is contrived in consideration of such a situation,and an object thereof is to provide a technology for improving thecoding efficiency by reducing the coding amount of the quantizationparameter.

In order to solve the problem described above, a moving picture codingdevice according to an aspect of the present invention is a movingpicture coding device that further divides a first block acquired bydividing each picture of a moving picture into a predetermined size intoone or a plurality of second blocks and codes the moving picture inunits of blocks, the moving picture coding device including:

a quantization parameter calculation unit (110) configured to calculatea quantization parameter of the second block;

a predictive quantization parameter deriving unit (114) configured toderive a predictive quantization parameter of the second block by usingthe quantization parameter of one or a plurality of third blocks thatare neighboring to the second block;

a differential quantization parameter generation unit (111) configuredto generate a differential quantization parameter of the second blockbased on a difference between the quantization parameter and thepredictive quantization parameter of the second block; and

a coding unit (112) configured to code the differential quantizationparameter of the second block. The predictive quantization parameterderiving unit (114) derives the predictive quantization parameter of thesecond block by using a quantization parameter of a fourth block codedbefore the second block in a case where the third block neighboring tothe second block is located at a position beyond a boundary of the firstblock.

According to another aspect of the present invention, there is alsoprovided a moving picture coding device. This device is a moving picturecoding device that codes a moving picture by using a motion-compensatedprediction in units of coding blocks that are acquired by furtherdividing a block acquired by dividing each picture of the moving pictureinto a predetermined size into one or a plurality of coding blocks. Themoving picture coding device includes: a quantization parametercalculation unit (110) configured to calculate a quantization parameterof the coding block; a predictive quantization parameter deriving unit(114) configured to derive a predictive quantization parameter of thecoding block by using the quantization parameter of a coded neighboringblock neighboring to the coding block in accordance with a predictionmode of the motion-compensated prediction of the coding block; adifferential quantization parameter generation unit (111) configured togenerate a differential quantization parameter of the coding block basedon a difference between the quantization parameter and the predictivequantization parameter of the coding block; and a coding unit (112)configured to code the differential quantization parameter of the codingblock. The predictive quantization parameter deriving unit (114), in acase where a neighboring block neighboring to the coding block in apredetermined direction is located at a position beyond a boundary ofthe block of the predetermined size, derives the predictive quantizationparameter of the coding block by using the quantization parameter ofanother coded block other than the neighboring block neighboring in thepredetermined direction.

According to a further another aspect of the present invention, there isprovided a moving picture coding method. This method is a moving picturecoding method for further dividing a first block acquired by dividingeach picture of a moving picture into a predetermined size into one or aplurality of second blocks and coding the moving picture in units ofblocks. The moving picture coding method includes: calculating aquantization parameter of the second block; deriving a predictivequantization parameter of the second block by using the quantizationparameter of one or a plurality of third blocks that are neighboring tothe second block; generating a differential quantization parameter ofthe second block based on a difference between the quantizationparameter and the predictive quantization parameter of the second block;and coding the differential quantization parameter of the second block.In the deriving of a predictive quantization parameter, the predictivequantization parameter of the second block is derived by using aquantization parameter of a fourth block coded before the second blockin a case where the third block neighboring to the second block islocated at a position beyond a boundary of the first block.

A moving picture decoding device according to an aspect of the presentinvention is a moving picture decoding device that further divides afirst block acquired by dividing each picture of a moving picture into apredetermined size into one or a plurality of second blocks and decodesa bit stream in which the moving picture is coded, the moving picturedecoding device including:

a decoding unit (202) configured to extract a differential quantizationparameter of the second block by decoding the bitstream;

a predictive quantization parameter deriving unit (205) configured toderive a predictive quantization parameter of the second block by usingthe quantization parameter of one or a plurality of third blocksneighboring to the second block; and

a quantization parameter generation unit (203) configured to generate aquantization parameter of the second block by adding the differentialquantization parameter and the predictive quantization parameter of thesecond block. The predictive quantization parameter deriving unit (205)derives the predictive quantization parameter of the second block byusing a quantization parameter of a fourth block decoded before thesecond block in a case where the third block neighboring to the secondblock is located at a position beyond a boundary of the first block.

According to another aspect of the present invention, there is alsoprovided a moving picture decoding device. This device is a movingpicture decoding device that further divides a block acquired bydividing each picture of a moving picture into a predetermined size intoone or a plurality of coding blocks and decodes a bitstream in which themoving picture is coded in units of the coding blocks. The movingpicture decoding device includes: a decoding unit (202) configured toextract a differential quantization parameter of a decoding block bydecoding the bitstream in units of decoding blocks; a predictivequantization parameter deriving unit (205) configured to derive apredictive quantization parameter of the decoding block by using thequantization parameter of a decoded neighboring block neighboring to thedecoding block in accordance with the prediction mode of themotion-compensated prediction of the decoding block; and a quantizationparameter generation unit (203) configured to generate a quantizationparameter of decoding block by adding the differential quantizationparameter and the predictive quantization parameter of the decodingblock. The predictive quantization parameter deriving unit (205) derivesthe predictive quantization parameter of the decoding block by using aquantization parameter of another decoded block other than a neighboringblock neighboring in a predetermined direction in a case where theneighboring block neighboring to the decoding block in the predetermineddirection is located at a position beyond a boundary of the block of thepredetermined size.

According to a further another aspect of the present invention, there isprovided a moving picture decoding method. This method is a movingpicture decoding method for further dividing a first block acquired bydividing each picture of a moving picture into a predetermined size intoone or a plurality of second blocks and decoding a bitstream in whichthe moving picture is coded. The moving picture decoding methodincludes: extracting a differential quantization parameter of the secondblock by decoding the bitstream; deriving a predictive quantizationparameter of the second block by using the quantization parameter of oneor a plurality of third blocks neighboring to the second block; andgenerating a quantization parameter of the second block by adding thedifferential quantization parameter and the predictive quantizationparameter of the second block. In the deriving of a predictivequantization parameter, the predictive quantization parameter of thesecond block is derived by using a quantization parameter of a fourthblock decoded before the second block in a case where the third blockneighboring to the second block is located at a position beyond aboundary of the first block.

Furthermore, an arbitrary combination of the constituent elementsdescribed above and a conversion of the representation of the presentinvention among a method, a device, a recording medium, a computerprogram, and the like are valid as aspects of the present invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram that illustrates the configuration of a movingpicture coding device using a predictive quantization parameter derivingmethod according to an embodiment;

FIG. 2 is a block diagram that illustrates the configuration of a movingpicture decoding device using a predictive quantization parameterderiving method according to an embodiment;

FIG. 3 is a diagram that illustrates the control of the amount of codingwithin a screen of MPEG-2 TM5;

FIG. 4 is a diagram that illustrates a quantization parameter predictionmethod according to H.264;

FIG. 5 is a diagram that illustrates an example of a coding processsequence in a case where hierarchical tree coding is used;

FIG. 6 is a diagram that illustrates the prediction of a quantizationparameter of an upper left coding block arranged inside a tree blockdivided by the hierarchical tree coding;

FIG. 7 is a diagram that illustrates an example of the sequence of acoding process inside a tree block divided by the hierarchical treecoding;

FIG. 8 is a diagram that illustrates an example in which patterns areincluded in a left and upper left blocks that are neighboring codedblocks close to a coding block that is a coding target;

FIG. 9 is a diagram that illustrates the positions of coding blocks thatare vertically adjacent to each other in the control of the amount ofcoding within the screen of the MPEG-2 TM5;

FIG. 10 is a block diagram that illustrates a detailed configuration ofa predictive quantization parameter deriving unit according to thisembodiment;

FIG. 11 is a diagram that illustrates values of intra prediction modesdefined in this embodiment and prediction directions;

FIG. 12 is a diagram that illustrates an example of a signed exponentialGolomb coding table of a differential quantization parameter;

FIG. 13 is a diagram that illustrates relation between a coding targettree block and a coded tree block;

FIG. 14 is a diagram that illustrates relation between a coding blockand coded blocks arranged inside a tree block divided through thehierarchical tree coding;

FIG. 15 is a diagram that illustrates a reference destination of apredictive quantization parameter of a coding block of a first example;

FIG. 16 is a diagram that illustrates an example in which quantizationparameters of neighboring coded blocks are illustrated as predictivequantization parameters of a coding block as reference destinations;

FIG. 17 is a flowchart that illustrates an operation of a firstpredictive quantization parameter deriving unit of the first example;

FIG. 18 is a flowchart that illustrates another operation of the firstpredictive quantization parameter deriving unit of the first example;

FIG. 19 is a diagram that illustrates a reference destination of apredictive quantization parameter of a coding block of a second example;

FIG. 20 is a flowchart that illustrates an operation of a firstpredictive quantization parameter deriving unit of the second example;

FIG. 21 is a diagram that illustrates a reference destination of apredictive quantization parameter of a coding block of a third example;

FIG. 22 is a flowchart that illustrates an operation of a firstpredictive quantization parameter deriving unit of the third example;

FIG. 23 is a diagram that illustrates a reference destination of apredictive quantization parameter of a coding block of a fourth example;

FIG. 24 is a flowchart that illustrates an operation of a firstpredictive quantization parameter deriving unit of the fourth example;

FIG. 25 is a diagram that illustrates a reference destination of apredictive quantization parameter of a coding block of a fifth example;

FIG. 26 is a flowchart that illustrates an operation of a predictivequantization parameter deriving unit of the fifth example;

FIG. 27 is a diagram that illustrates values of intra prediction modesdefined in this embodiment and prediction directions;

FIG. 28 is a flowchart that illustrates an operation of a secondpredictive quantization parameter deriving unit 304 of a sixth example;

FIG. 29 is a diagram that illustrates a table converting an intraprediction mode into an intra prediction direction;

FIG. 30 is a diagram that illustrates setting of quantization parametersof neighboring blocks that are referred to in a prediction direction ofan intra prediction mode of the sixth example;

FIG. 31 is a flowchart that illustrates a detailed operation of adetermination process according to an intra prediction direction in asecond predictive quantization parameter deriving unit of the sixthexample;

FIG. 32 is a diagram that illustrates setting of a weighting coefficientin a prediction direction of an intra prediction mode of the sixthexample;

FIG. 33 is a flowchart that illustrates a detailed operation of adetermination process according to an intra prediction direction in asecond predictive quantization parameter deriving unit of the sixthexample;

FIG. 34 is a diagram that illustrates setting of other weightingcoefficients in prediction directions of intra prediction modes of thesixth example;

FIG. 35 is a flowchart that illustrates a detailed operation in a casewhere an intra prediction direction is within a predetermined rangeillustrated in FIG. 34 in the second predictive quantization parameterderiving unit of the sixth example;

FIG. 36 is a diagram that illustrates a reference destination of apredictive quantization parameter of a coding block of a seventhexample;

FIG. 37 is a flowchart that illustrates an operation of a secondpredictive quantization parameter deriving unit of the seventh example;

FIG. 38 is a flowchart that illustrates a detailed operation of adetermination process according to an intra prediction direction in thesecond predictive quantization parameter deriving unit of the seventhexample;

FIG. 39 is a flowchart that illustrates an operation of a firstpredictive quantization parameter deriving unit of an eighth example;

FIG. 40 is a flowchart that illustrates a detailed operation of adetermination process according to an intra prediction direction in thesecond predictive quantization parameter deriving unit of the eighthexample;

FIG. 41 is a flowchart that illustrates a detailed operation of a casewhere the intra prediction direction is zero in the second predictivequantization parameter deriving unit of the eighth example;

FIG. 42 is a flowchart that illustrates a detailed operation of a casewhere the intra prediction direction is smaller than 18 in the secondpredictive quantization parameter deriving unit of the eighth example;

FIG. 43 is a flowchart that illustrates a detailed operation of a casewhere the intra prediction direction is larger than or equal to 18 inthe second predictive quantization parameter deriving unit of the eighthexample;

FIG. 44 is a flowchart that illustrates a detailed operation ofswitching between weighting coefficients in a determination process of acase where the intra prediction direction is zero in the secondpredictive quantization parameter deriving unit of the eighth example;

FIG. 45 is a flowchart that illustrates a detailed operation ofswitching among weighting coefficients in the determination processaccording to the intra prediction direction illustrated in FIG. 34 in asecond predictive quantization parameter deriving unit of the eighthexample;

FIG. 46 is a block diagram that illustrates another detailedconfiguration of a predictive quantization parameter deriving unit;

FIG. 47 is a flowchart that illustrates an operation of a secondpredictive quantization parameter deriving unit of a ninth example;

FIG. 48 is a flowchart that illustrates a detailed operation of adetermination process according to an intra prediction direction in thesecond predictive quantization parameter deriving unit of the ninthexample;

FIG. 49 is a flowchart that illustrates a detailed operation of a casewhere the intra prediction direction is zero in the second predictivequantization parameter deriving unit of the ninth example;

FIG. 50 is a flowchart that illustrates a detailed operation of a casewhere the intra prediction direction is smaller than 18 in the secondpredictive quantization parameter deriving unit of the ninth example;

FIG. 51 is a flowchart that illustrates a detailed operation of a casewhere the intra prediction direction is larger than or equal to 18 inthe second predictive quantization parameter deriving unit of the ninthexample;

FIG. 52 is a flowchart that illustrates a detailed operation of arecalculation determination unit;

FIG. 53 is a diagram that illustrates an example of a quantizationgroup; and

FIG. 54 is a diagram that illustrates an example of a prediction of aquantization parameter in units of quantization groups.

DETAILED DESCRIPTION

The invention will now be described by reference to the preferredembodiments. This does not intend to limit the scope of the presentinvention, but to exemplify the invention.

An embodiment of the present invention provides a coding amount controltechnology for deriving an optimal predictive quantization parameterfrom coding information of a coded block disposed on the periphery,calculating a difference from the predictive quantization parameter, andcoding the difference for reducing the coding amount of the quantizationparameter of a processing target block in moving picture coding in whicha picture is divided into rectangular blocks of a predetermined size,the block is further divided into one or a plurality of coding blocks,and quantization and coding are performed in units of the coding blocks.

A preferred moving picture coding device 100 and a preferred movingpicture decoding device 200 according to the present invention will nowbe described. FIG. 1 is a block diagram that illustrates theconfiguration of the moving picture coding device 100 according to thepresent invention. The moving picture coding device 100 is configuredby: a picture memory 101; a residual signal generation unit 102; anorthogonal transform and quantization unit 103; a second bitstreamgeneration unit 104; an inverse quantization and inverse orthogonaltransform unit 105; a decoded picture signal superimposing unit 106; adecoded picture memory 107; a predicted picture generation unit 108; anactivity calculation unit 109; a quantization parameter calculation unit110; a differential quantization parameter generation unit 111; a firstbitstream generation unit 112; a coding information storage memory 113;a predictive quantization parameter deriving unit 114; and a bitstreammultiplexing unit 115. Here, each thick solid-line arrow that joinsblocks represents a picture signal of a picture, and each thinsolid-line arrow represents the flow of a parameter signal used forcontrolling coding.

The picture memory 101 temporarily stores picture signals of codingtargets that are supplied in order of capture/display time. The picturememory 101 supplies the stored picture signals of the coding targets inunits of predetermined pixel blocks to the residual signal generationunit 102, the predicted picture generation unit 108, and the activitycalculation unit 109. At that time, the pictures stored in order of thecapture/display time are rearranged in order of coding and are outputfrom the picture memory 101 in units of pixel blocks.

The residual signal generation unit 102 performs subtraction between apicture signal to be coded and a prediction signal generated by thepredicted picture generation unit 108 to generate a residual signal andsupplies the residual signal to the orthogonal transform andquantization unit 103.

The orthogonal transform and quantization unit 103 generates anorthogonally-transformed and quantized residual signal by performingorthogonal transform and quantization of the residual signal andsupplies the generated orthogonally-transformed and quantized residualsignal to the second bitstream generation unit 104 and the inversequantization and inverse orthogonal transform unit 105.

The second bitstream generation unit 104 generates a second bitstream byperforming entropy coding of the orthogonally-transformed and quantizedresidual signal in accordance with a regulated syntax rule and suppliesthe generated second bitstream to the bitstream multiplexing unit 115.

The inverse quantization and inverse orthogonal transform unit 105calculates a residual signal by performing inverse quantization and aninverse orthogonal transform of the orthogonally-transformed andquantized residual signal supplied form the orthogonal transform andquantization unit 103 and supplies the calculated residual signal to thedecoded picture signal superimposing unit 106.

The decoded picture signal superimposing unit 106 generates a decodedpicture by superimposing a predictive picture signal generated by thepredicted picture generation unit 108 and a residual signal that isinversely quantized and inversely orthogonally-transformed by theinverse quantization and inverse orthogonal transform unit 105 eachother and stores the generated decoded picture in the decoded picturememory 107. In addition, there is also a case where a filtering processdecreasing a distortion such as a block distortion according to codingis performed for the decoded picture, and the processed decoded pictureis stored in the decoded picture memory 107. In such a case, as isnecessary, predicted coding information such as a flag used foridentifying information of a post filter such as a deblocking filter isstored in the coding information storage memory 113.

The predicted picture generation unit 108 makes an in-frame prediction(intra prediction) or an inter-frame prediction (inter prediction) basedon a prediction mode in accordance with a picture signal supplied fromthe picture memory 101 and a decoded picture signal supplied from thedecoded picture memory 107, thereby generating a predictive picturesignal. In the intra prediction, a predictive picture signal isgenerated by using pixel signals of a coding target block out of blocks,which are acquired by dividing a picture signal supplied from thepicture memory 101 in units of predetermined blocks, and a codedneighboring block located close to the coding target block that ispresent within the same frame as that of the coding target blocksupplied from the decoded picture memory 107. In the inter prediction, acoded frame that is stored in the decoded picture memory 107 that isseparated from a frame (coding frame) of the coding target blockacquired by dividing a picture signal supplied from the picture memory101 in units of predetermined blocks by several frames before or afteris set as the reference frame, and the amount of movement called amotion vector is acquired by performing block matching between thecoding block and the reference frame, and a predictive picture signal isgenerated by performing motion compensation from the reference framebased on the amount of motion. Then, the predictive picture signalgenerated in such a way is supplied to the residual signal generationunit 102. The coding information of a motion vector or the like acquiredby the predicted picture generation unit 108 is stored in the codinginformation storage memory 113 as is necessary. In addition, in thepredicted picture generation unit 108, in a case where a plurality ofprediction modes can be selected, by evaluating the amount of distortionbetween the generated predictive picture signal and the original picturesignal or the like, an optimal prediction mode is determined, apredictive picture signal that is generated by a prediction according tothe determined prediction mode is selected, the selected predictivepicture signal is supplied to the residual signal generation unit 102,and, in a case where the prediction mode is the intra prediction, theintra prediction mode is supplied to the coding information storagememory 113 and the first bitstream generation unit. The intra predictionmode will be described in detail later.

The activity calculation unit 109 calculates an activity that is acoefficient representing the complexity or the smoothness of the pictureof the coding target bock that is supplied from the picture memory 101and supplies the calculated activity to the quantization parametercalculation unit 110. The detailed configuration and the operation ofthe activity calculation unit 109 will be described in an example to bedescribed later.

The quantization parameter calculation unit 110 calculates aquantization parameter of the coding target block based on the activitycalculated by the activity calculation unit 109 and supplies thecalculated quantization parameter to the differential quantizationparameter generation unit 111 and the coding information storage memory113. The detailed configuration and the operation of the quantizationparameter calculation unit 110 will be described in an example to bedescribed later.

The differential quantization parameter generation unit 111 calculates adifferential quantization parameter by performing subtraction betweenthe quantization parameter calculated by the quantization parametercalculation unit 110 and the predictive quantization parameter derivedby the predictive quantization parameter deriving unit 114 and suppliesthe calculated differential quantization parameter to the firstbitstream generation unit 112.

The first bitstream generation unit 112 generates a first bitstream bycoding the differential quantization parameter calculated by thedifferential quantization parameter generation unit 111 in accordancewith a regulated syntax rule and supplies the generated first bitstreamto the bitstream multiplexing unit 115.

The coding information storage memory 113 stores the quantizationparameter of a coded block. While a connection line is not illustratedin FIG. 1, coding information such as a prediction mode and a motionvector generated by the predicted picture generation unit 108 is alsostored as information that is necessary for coding the next codingtarget block. In addition, coding information generated in units ofpictures or slices is also stored as is necessary.

The predictive quantization parameter deriving unit 114 derives apredictive quantization parameter using the quantization parameter andthe coding information of a coded block that is located close to theperiphery of the coding target block and supplies the derived predictivequantization parameter to the differential quantization parametergeneration unit 111. The detailed configuration and the operation of thepredictive quantization parameter deriving unit 114 will be described inan example to be described later.

The bitstream multiplexing unit 115 multiplexes the first bitstream andthe second bitstream in accordance with a regulated syntax rule andoutputs the multiplexed bitstream.

FIG. 2 is a block diagram that illustrates the configuration of a movingpicture decoding device 200 according to an embodiment corresponding tothe moving picture coding device 100 illustrated in FIG. 1. The movingpicture decoding device 200 according to the embodiment includes: abitstream separation unit 201; a first bitstream decoding unit 202; aquantization parameter generation unit 203; a coding information storagememory 204; a predictive quantization parameter deriving unit 205; asecond bitstream decoding unit 206; an inverse quantization and inverseorthogonal transform unit 207; a decoded picture signal superimposingunit 208; a predicted picture generation unit 209; and a decoded picturememory 210. Similarly to the moving picture coding device 100illustrated in FIG. 1, each thick solid-line arrow that joins blocksrepresents a picture signal of a picture, and each thin solid-line arrowrepresents the flow of a parameter signal used for controlling coding.

Since the decoding process of the moving picture decoding device 200illustrated in FIG. 2 corresponds to the coding process provided insidethe moving picture coding device 100 illustrated in FIG. 1, theconfigurations of the inverse quantization and inverse orthogonaltransform unit 207, the decoded picture signal superimposing unit 208,the predicted picture generation unit 209, the decoded picture memory210, and the coding information storage memory 204 illustrated in FIG. 2have functions that respectively correspond to the configurations of theinverse quantization and inverse orthogonal transform unit 105, thedecoded picture signal superimposing unit 106, the predicted picturegeneration unit 108, decoded picture memory 107, and the codinginformation storage memory 113 of the moving picture coding device 100illustrated in FIG. 1.

The bitstream supplied to the bitstream separation unit 201 is separatedin accordance with a regulated syntax rule, and separated bitstreams aresupplied to the first bitstream decoding unit 202 and the secondbitstream decoding unit 206.

The first bitstream decoding unit 202 decodes the supplied bitstream,outputs coding information relating to a prediction mode, a motionvector, a differential quantization parameter, and the like, suppliesthe differential quantization parameter to the quantization parametergeneration unit 203, and stores the coding information in the codinginformation storage memory 204.

The quantization parameter generation unit 203 calculates a quantizationparameter by adding the differential quantization parameter suppliedfrom the first bitstream decoding unit 202 and the quantizationparameter derived by the predictive quantization parameter deriving unit205 together and supplies the calculated quantization parameter to theinverse quantization and inverse orthogonal transform unit 207 and thecoding information storage memory 204.

The coding information storage memory 113 stores the quantizationparameter of a block that has decoded. In addition, not only the codinginformation in units of blocks decoded by the first bitstream decodingunit 202 but also coding information generated in units of pictures orslices is also stored as is necessary. While a connection line is notillustrated in FIG. 2, the coding information such as a prediction mode,a motion vector, and the like that have been decoded to the predictedpicture generation unit 209.

The predictive quantization parameter deriving unit 205 derives apredictive quantization parameter by using the quantization parameterand the coding information of a decoded block that is located close tothe periphery of the decoding target block and supplies the predictivequantization parameter to the quantization parameter generation unit203. The predictive quantization parameter deriving unit 205 has afunction that is equivalent to the function of the predictivequantization parameter deriving unit 114 of the moving picture codingdevice 100, and the detailed configuration and the operation thereofwill be described in an example to be described later.

The second bitstream decoding unit 206 calculates an orthogonallytransformed and quantized residual signal by decoding the suppliedbitstream and supplies the orthogonally transformed and quantizedresidual signal to the inverse quantization and inverse orthogonaltransform unit 207.

The inverse quantization and inverse orthogonal transform unit 207performs an inverse orthogonal transform and inverse quantization of theorthogonally transformed and quantized residual signal decoded by thesecond bitstream decoding unit 206 by using the quantization parametergenerated by the quantization parameter generation unit 203, therebyacquiring an inversely orthogonally-transformed and inversely quantizedresidual signal.

The decoded picture signal superimposing unit 208 generates a decodedpicture signal by superimposing the predictive picture signal that isgenerated by the predicted picture generation unit 209 and the residualsignal that is inversely orthogonally-transformed and inverselyquantized by the inverse quantization and inverse orthogonal transformunit 207 each other, outputs the generated decoded picture signal, andstores the generated decoded picture signal in the decoded picturememory 210. When the generated decoded picture signal is stored in thedecoded picture memory 210, there is also a case where a filteringprocess reducing a block distortion or the like according to coding isperformed for the decoded picture, and the processed decoded picture isstored in the decoded picture memory 210.

The predicted picture generation unit 209 generates a predictive picturesignal using the decoded picture signal supplied from the decodedpicture memory 210 based on the coding information of a prediction mode,a motion vector, and the like decoded by the second bitstream decodingunit 206 and the coding information stored in the coding informationstorage memory 204 and supplies the generated predictive picture signalto the decoded picture signal superimposing unit 208.

Next, a method of deriving a predictive quantization parameter that isused to be common to several units 120 of the moving picture codingdevice 100 that are surrounded by a thick dotted line, particularly, thepredictive quantization parameter deriving unit 114 and several units220 of the moving picture decoding device 200 that are surrounded by athick dotted line, particularly, the predictive quantization parameterderiving unit 205 will be described in detail.

First, the operation of each of the units 120 of the moving picturecoding device 100 according to this embodiment that are surrounded bythe thick dotted line will be described. In the units 120, a pixel blockformed in units of a predetermined pixel size, which is supplied fromthe picture memory 101, is set as a coding block, and a quantizationparameter used for quantizing the block is determined. The quantizationparameter is determined mainly based on algorithms of coding amountcontrol and adaptive quantization. First, a technique for the adaptivequantization that is used in the activity calculation unit 109 will bedescribed.

Generally, since the visual characteristics of humans are sensitive to alow frequency component in which the number of edges is small, theactivity calculation unit 109 calculates an activity representing thecomplexity and the smoothness of a picture in units of predeterminedblocks such that quantization is performed more finely for a flatportion in which visual deterioration can easily stand out visually, andquantization is performed more roughly for a portion having a complexpattern in which deterioration cannot easily stand out visually.

As an example of the activity, a value according to a variance value ofpixels inside a coding block described in MPEG-2 Test Model 5 (TM5) maybe calculated. The variance value represents the degree of dispersionfrom the average of pixels that configure a picture within a block. Thevariance value decreases in accordance with the degree of the flatnessof a picture within a block (a small change in luminance) and increasesin accordance with the degree of complexity of a pattern of the picture(a large change in luminance). Accordingly, the variance value is usedas the activity of the block. When a pixel value within a block isrepresented by p(x, y), the activity “act” of the block is calculated byusing the following equation.

$\begin{matrix}{{act} = {\sum\limits_{x,y}^{BLK}\; \left( {{p\left( {x,y} \right)} - {p\_ mean}} \right)^{2}}} & \left\lbrack {{Expression}\mspace{14mu} 1} \right\rbrack\end{matrix}$

Here, BLK represents the total number of pixels of a coding block, andp_mean represents an average value of pixels disposed within the block.

However, the activity is not limited to the variance as described above,but a total sum of the absolute values of differences between the valueof each pixel disposed within the coding block and the values of pixelsneighboring thereto in the horizontal and vertical directions within theblock may be used as the activity. Even in such a case, the total sum issmall in a case where the picture is flat and is large in a portion of acomplex pattern in which the number of edges is large and can be used asthe activity. The total sum is calculated by using the followingequation.

$\begin{matrix}{{act} = {\sum\limits_{x,y}^{BLK}\; \left( {{{{p\left( {x,y} \right)} - {p\left( {{x + 1},y} \right)}}} + \left. {{p\left( {x,y} \right)} - {p\left( {x,{y + 1}} \right.}} \right)} \right.}} & \left\lbrack {{Expression}\mspace{14mu} 2} \right\rbrack\end{matrix}$

The activity “act” calculated in this way is supplied to thequantization parameter calculation unit 110.

Next, the coding amount control will be described. In the moving picturecoding device 100 according to this embodiment, while a unit thatrealizes the coding amount control is not particularly provided, inorder to determine a quantization parameter of a coding block based onthe generated coding amount in the coding amount control, the functionwill be described as being included in the quantization parametercalculation unit 110.

An object of the coding amount control is to adjust the generated codingamount that is generated in a predetermined unit such as a frame to neara target coding amount. Thus, in a case where the generated codingamount of coding blocks is determined to be larger than the targetcoding amount, relatively rough quantization is applied to blocks to besubsequently coded. On the other hand, in a case where the generatedcoding amount of the coding blocks is determined to be smaller than thetarget coding amount, relatively fine quantization is applied to blocksto be subsequently coded.

The detailed algorithm of the coding amount control will be describedwith reference to FIG. 3.

First, a target coding amount (T) is determined for each frame.Generally, the target coding amount T is determined such that “Ipicture>P picture>reference B picture>non-reference B picture” issatisfied. For example, in a case where the target bit rate of a movingpicture is 5 Mbps, and there are one I picture, three P pictures, 11reference B pictures, and 15 non-reference B pictures, when the targetcoding amounts of picture types are denoted by Ti, Tp, Tbr, and Tb,Ti=400 kbit, Tp=300 kbit, Tbr=200 kbit, and Tb=100 kbit in a case wherethe target coding amounts are desired to be controlled such that theratio Ti:Tp:Tbr:Tb=4:3:2:1. However, the coding amounts assigned to thepicture types do not have an effect on the essence of the presentinvention.

Next, in-frame coding amount control will be described. When the numberof blocks that is a unit for determining the quantization parameter isdenoted by N, a generated coding amount is denoted by B, and adifference bit that is different from the target coding amount isdenoted by D, the following equation is formed.

$\begin{matrix}{{D(j)} = {{D(0)} + {B\left( {j - 1} \right)} - \frac{T\left( {j - 1} \right)}{N}}} & \left\lbrack {{Expression}\mspace{14mu} 3} \right\rbrack\end{matrix}$

Here, j is a coding process sequence count number of a coding block. Inaddition, D(0) is an initial value of a difference from the targetcoding amount.

A quantization parameter bQP according to the coding amount control isdetermined as below.

bQP(j)=D(j)×r   [Expression 4]

Here, r denotes a proportional coefficient used for converting thedifference from the target coding amount into a quantization parameter.This proportional coefficient r is determined in accordance with ausable quantization parameter.

The quantization parameter calculation unit 110, by using the activity“act” calculated by the activity calculation unit 109 for each codingblock, changes the quantization parameter of the coding block that iscalculated in the coding amount control. Hereinafter, since thequantization parameter is calculated for each coding block, the codingprocess sequence count number of the quantization parameter according tothe coding amount control will be removed, and the quantizationparameter will be represented as bQP.

The quantization parameter calculation unit 110 calculates aquantization parameter QP that is optimal to the coding block based onthe activity “act” calculated by the activity calculation unit 109.

The quantization parameter calculation unit 110 records an averageactivity within the frame that has been immediately previously coded asavg_act and calculates a normalized activity Nact of the coding block byusing the following equation.

$\begin{matrix}{{Nact} = \frac{{2 \times {act}} + {avg\_ act}}{{act} + {2 \times {avg\_ act}}}} & \left\lbrack {{Expression}\mspace{14mu} 5} \right\rbrack\end{matrix}$

Here, the coefficient “2” of the equation represented above is a valuerepresenting a dynamic range of the quantization parameter, and anormalized activity Nact that is in the range of 0.5 to 2.0 iscalculated.

In addition, regarding avg_act, before the coding process, activitiesmay be calculated in advance for all the blocks within the frame, andthe average value thereof may be set as avg_act.

Furthermore, avg_act may be stored in the coding information storagememory 113. In such a case, the quantization parameter calculation unit110 may be configured to derive avg_act from the coding informationstorage memory 113 as is necessary.

The calculated normalized activity Nact is multiplied by thequantization parameter bQP that is the reference as in the followingequation, whereby a quantization parameter QP of the coding bock isacquired.

QP=Nact×bQP   [Expression 6]

Here, while bQP is set as the quantization parameter in units of blocksthat is calculated in the coding amount control as described above, itmay be set as a quantization parameter that represents a frame or aslice including the coding block as a fixed value. In addition, bQP maybe set as an average quantization parameter of a frame that has beenimmediately previously coded, and, in this embodiment, the method ofcalculation thereof is not particularly limited.

The quantization parameter of the coding block that is calculated insuch a way is supplied to the coding information storage memory 113 andthe differential quantization parameter generation unit 111.

In the coding information storage memory 113, not only the quantizationparameter calculated by the quantization parameter calculation unit 110and the quantization parameter of the past coding block for which codinghas been completed are stored but also coding information such as amotion vector and a prediction mode of the coding block that are to becoded is stored, and each unit derives the coding information as isnecessary.

The predictive quantization parameter deriving unit 114 derives apredictive quantization parameter for efficiently coding andtransmitting the quantization parameter of the coding block by using thequantization parameter of a coded neighboring block disposed on theperiphery of the coding block and the other coding information that areacquired from the coding information storage memory 113.

From the aspect of efficiently coding and transmitting the quantizationparameter, the efficiency of a case where a difference (differentialquantization parameter) from the quantization parameter of a coded blockis taken, and the differential quantization parameter is coded andtransmitted is higher than that of a case where the quantizationparameter is directly coded. From the viewpoint of the coding amountcontrol, by setting the quantization parameter of an immediatelyprevious coded block in the coding process sequence as the predictivequantization parameter, the value of the differential quantizationparameter to be transmitted decreases, whereby the coding amountdecreases. On the other hand, from the viewpoint of adaptivequantization, since a coding block and a neighboring block disposed onthe periphery thereof are close to each other, the patterns thereof arefrequently the same or similar to each other, and accordingly, theactivity of a block close to the coding block has a value close to thatof the activity of the coding block. Accordingly, by setting thequantization parameter of a neighboring block as the predictivequantization parameter, the value of the differential quantizationparameter decreases, whereby the coding amount decreases. Thus,according to H.264, as illustrated in FIG. 4, a method is employed inwhich the unit, in which the quantization parameter is transmitted, isfixed to a macro block (16×16 pixel group), the quantization parameterof a block arranged before the coding block in the raster scanningsequence or a neighboring block close to the left side, which has beenimmediately previously coded, is set as the predictive quantizationparameter, a difference between the quantization parameter of the codingblock and the predictive quantization parameter is taken, and adifferential quantization parameter is coded and transmitted. In otherwords, H.264 is optimized to a prediction of the quantization parameterthat is made in consideration of the coding amount control. However,since hierarchical tree coding to be described later is not performed inH.264, the immediately previous block is a left block except for thecase of the left end of a picture, the quantization parameter of aneighboring block is used as the predictive quantization parameter, andaccordingly, H.264 can be regarded as being approximately optimized alsoto a prediction that is made in consideration of the adaptivequantization. Accordingly, in the case of a configuration like H.264such as a configuration in which the unit, in which the quantizationparameter is transmitted, is fixed, and the hierarchical tree coding isnot performed, an immediately previously coded block can be regarded asbeing optimal for the prediction of the quantization parameter.

However, in a case where the hierarchical tree coding is performed,similarly to H.264, by using the quantization parameter of theimmediately previous block as the predictive quantization parameter,while the prediction is optimized to the coding amount control, in acase where the quantization parameter is transmitted using the adaptivequantization, an optimal prediction value is not acquired, and there isa problem in that the coding amount of the differential quantizationparameter increases.

Here, the hierarchical tree coding will be described. In thehierarchical tree coding described here, each depth representing acoding unit is determined in units of tree blocks (here, 64×64 blocks),and coding is performed in units of coding blocks using determineddepths. Accordingly, the coding can be performed with each optimal depthdepending on the fineness of the picture being determined, and thecoding efficiency is improved to a large extent.

FIG. 5 illustrates a coding process sequence of a hierarchical treecoding structure. As illustrated on the upper side of FIG. 5, the insideof the screen is equally divided in units of squares having apredetermined same size. These units are called tree blocks and arebasic units used for managing addresses for specifying coding/decodingblocks within a picture. In order to optimize the coding process inaccordance with a texture and the like arranged inside the picture, theinside of the tree block may be hierarchically divided into four partsas is necessary so as to acquire blocks having a small size. Thehierarchical block structure configured as above by dividing blocks intothe small blocks is called a tree block structure, and the dividedblocks are called coding blocks (CU: coding unit) and are set as basicunits of the process at the time of performing coding and decoding. Onthe lower side of FIG. 5, an example is illustrated in which three CUsacquired by excluding a lower left CU from CUs formed by dividing a treeblock into four parts are divided into four parts. In this example, thequantization parameters are assumed to be set in units of the CUs. Thetree block is a coding block of a maximum size.

In such hierarchical tree coding, since the coding sequence is differentfrom the raster scanning sequence (the left side to the right side) ofH.264 illustrated in FIG. 4, there is a case where the quantizationparameter of an immediately previously coded block and that of aneighboring block disposed on the left side are not the same. Forexample, as illustrated in FIG. 6 as an example of the hierarchical treecoding, for a prediction of an upper left coding block (a hatchedrectangle illustrated in FIG. 6) disposed inside a tree block that is acoding target, the quantization parameter of a lower right coding block(a gray rectangle illustrated in FIG. 6) that has been coded last out ofblocks divided inside a tree block that is neighboring to the left sideis used. In addition, as illustrated in FIG. 7, for a prediction of alower left coding block (a hatched rectangle illustrated in FIG. 7)disposed inside a tree block that is a coding target, the quantizationparameter of a block (a gray rectangle illustrated in FIG. 7) that isdivided in the same tree block and has been immediately previously codedis used. Accordingly, by only predicting the quantization parameter froma block that has been immediately previously coded, while a predictionthat is optimized to the coding amount control is made, a distancebetween the blocks according to the division is long, and accordingly, aprediction that is appropriate for the adaptive quantization cannot bemade, whereby the coding amount of the differential quantizationparameter increases so as to decrease the coding efficiency.

In addition, as in H.264, in a case where the quantization parameter ofa left block is uniquely set as the predictive quantization parameter,for example, in a case illustrated in FIG. 8, patterns of pictures of acoding block and a neighboring block disposed on the left side aredifferent from each other, and accordingly, the quantization parametersare affected. Therefore, the differential quantization parameter has alarge value so as to increase the amount of generated coding, andaccordingly, there is concern that the coding and the transmissioncannot be efficiently performed.

As a solution thereof, a method may be considered in which, instead ofuniquely selecting the predictive quantization parameter from theneighboring block disposed on the left side, the quantization parameterof the upper neighboring block that has been coded is set as thepredictive quantization parameter.

However, in a case where the quantization parameter is predicted fromthe upper neighboring block beyond the boundary of the tree block, whenthe calculation of the quantization parameter according to the codingamount control is considered, the quantization parameter is calculatedat a quite past time point from that of the coding block. Accordingly,as illustrated in

FIG. 9, with respect to the process sequence j of the coding block, theprocess sequence i of the upper neighboring block is i<<j in the codingprocess sequence even in a case where the blocks are close to each otherwithin a picture. Therefore, from the viewpoint of the coding amountcontrol, it cannot be necessarily determined that the quantizationparameter of the coding block has high correlation with the quantizationparameter of the upper neighboring block.

Furthermore, in order to increase the speed of the decoding process, ina case where parallel processing is performed for each tree block slice,the quantization parameter of the upper neighboring block beyond theboundary of the tree block cannot be used for a prediction. Accordingly,by referring to the upper neighboring block beyond the boundary of thetree block, there is concern that the coding and the transmission cannotbe efficiently performed.

Therefore, the predictive quantization parameter deriving unit 114according to the embodiment of the present invention derives an optimalpredictive quantization parameter from a coded block disposed on theperiphery instead of using the neighboring block of the tree block thatis located close to the upper side of the coding block for a predictionof the quantization parameter, thereby improving the efficiency of thegenerated coding amount of the differential quantization parameter.

FIG. 10 is diagram that illustrates a detailed configuration of thepredictive quantization parameter deriving unit 114. The predictivequantization parameter deriving unit 114 is configured by: a switch 301;a memory 302; a first predictive quantization parameter deriving unit303; and a second predictive quantization parameter deriving unit 304.

The coding information such as the quantization parameter of the codedneighboring block disposed on the periphery of the coding block and theprediction mode of the coding block, which is supplied from the codinginformation storage memory 113, is temporarily stored in the memory 302,and the prediction mode of the coding block is supplied to the switch301.

The switch 301 performs switching between deriving units that predictthe quantization parameter in accordance with the prediction mode. Thequantization parameter is derived by using the first predictivequantization parameter deriving unit 303 in a case where the predictionmode is the inter prediction and is derived by using the secondpredictive quantization parameter deriving unit 304 in a case where theprediction mode is the intra prediction.

The first predictive quantization parameter deriving unit 303 derivesthe predictive quantization parameter by performing a relativecomparison of the quantization parameter of the coded neighboring blockdisposed on the periphery of the coding block that is acquired from thememory 302.

On the other hand, the second predictive quantization parameter derivingunit 304 derives the predictive quantization parameter based on thequantization parameter of the coded neighboring block disposed on theperiphery of the coding block that is supplied from the memory 302 andthe intra prediction mode (hereinafter, referred to as an intraPredMode)representing the direction of pixels of the neighboring block that isreferred to in the intra prediction in a case where the intra predictionis selected by the predicted picture generation unit 108 as theprediction mode.

Here, the intra prediction will be described in detail. In the intraprediction, the value of a pixel of the coding block is predicted fromthe value of a pixel of a decoded neighboring block within the samescreen. The moving picture coding device 100 and the moving picturedecoding device 200 according to the present invention select an intraprediction mode from among intra prediction modes of 34 kinds and makean intra prediction.

FIG. 11 is a diagram that illustrates values of intra prediction modesdefined in this embodiment and prediction directions. Each solid-linearrow represents a direction to be referred to in the intra prediction,and the intra prediction is made from the endpoint to the start point ofthe arrow. In addition, each number represents the value of the intraprediction mode. As the intra prediction modes, in addition to avertical prediction (intra prediction mode intraPredMode=0) making aprediction in the vertical direction from a decoded block disposed onthe upper side, a horizontal prediction (intra prediction modeintraPredMode=1) making a prediction in the horizontal direction from adecoded block disposed on the left side, an average value prediction(intra prediction mode intraPredMode=2) making a prediction bycalculating an average value from decoded blocks disposed on theperiphery, and an average value prediction (intra prediction modeintraPredMode=3) making a prediction in a lower rightward direction fromdecoded blocks disposed on the periphery at an angle of 45 degrees,angle predictions (intra prediction modes intraPredMode=4, 5, . . . ,33) of 30 kinds making predictions in inclined directions at variousangles from decoded blocks disposed on the periphery are defined.

The intra prediction modes are prepared for each of a luminance signaland a color difference signal, and the intra prediction mode for aluminance signal is defined as an intra luminance prediction mode, andan intra luminance mode for a color difference signal is defined as anintra color difference prediction mode. In coding and decoding in theintra luminance prediction mode, a structure is used in whichinformation specifying the block that is referred to is transmitted in acase where it is determined that a prediction can be made from the intraluminance prediction mode of the neighboring block on the coding side byusing the correlation with the intra luminance prediction mode of aneighboring block, and the value of the intra luminance prediction modeis further coded or decoded in a case where setting another value to theintra luminance prediction mode is determined to be better than making aprediction from the intra luminance prediction mode of the neighboringblock. By predicting the intra luminance prediction mode of thecoding/decoding target block from the intra luminance prediction mode ofthe neighboring block, the amount of codes to be transmitted can bereduced. On the other hand, in coding and decoding in the intra colordifference prediction mode, a structure is used in which the value ofthe intra color difference prediction mode is predicted from the valueof the intra luminance prediction mode in a case where it is determinedthat a prediction can be made from the intra luminance prediction modeon the coding side by using the correlation with the intra luminanceprediction mode of the prediction block of a luminance signal that islocated at the same position as that of the prediction block of thecolor difference signal, and the value of the intra color differenceprediction mode is coded or decoded in a case where setting anindependent value to the intra color difference prediction mode isdetermined to be better than making a prediction from the intraluminance prediction mode. By predicting the intra color differenceprediction mode from the intra luminance prediction mode, the amount ofcodes to be transmitted can be reduced. In this embodiment, unlessotherwise noted, the intra luminance prediction mode is set as the intraprediction mode.

The predicted picture generation unit 108 selects an intra predictionmode having the highest coding efficiency from among the intraprediction modes of the 34 kinds and, in a case where an intraprediction is selected as the prediction mode, supplies the intraprediction mode together with the prediction mode to the predictivequantization parameter deriving unit 114 through the coding informationstorage memory 113.

The second predictive quantization parameter deriving unit 304 derives apredictive quantization parameter based on the intra prediction mode.The predictive quantization parameter derived in this way is supplied tothe differential quantization parameter generation unit 111.

The differential quantization parameter generation unit 111 generates adifferential quantization parameter by performing subtraction betweenthe quantization parameter of the coding block that is calculated by thequantization parameter calculation unit 110 and the predictivequantization parameter that is derived by the predictive quantizationparameter deriving unit 114. Since the predictive quantization parameteris derived from a coded neighboring block disposed on the periphery alsoat the time of decoding similarly to that at the time of decoding, bysetting the differential quantization parameter as a coding target, theamount of coding of the quantization parameter can be reduced withoutgenerating a contradiction in the coding and the decoding. Thecalculated differential quantization parameter is supplied to the firstbitstream generation unit 112.

The first bitstream generation unit 112 generates a first bitstream byperforming entropy coding of the differential quantization parametercalculated by the differential quantization parameter generation unit111 in accordance with a regulated syntax rule. FIG. 12 illustrates anexample of a coding conversion table used for entropy coding of thedifferential quantization parameter. This is a table called a signedexponential Golomb coding table and provides a shorter code length asthe absolute value of the differential quantization parameter issmaller. Generally, in a case where a picture is divided into blocks, inneighboring blocks, pictures are similar, and activities have valuesclose to each other, and calculated quantization parameters of theblocks have values close to each other. Accordingly, the occurrencefrequency of the differential quantization parameter is the highest forzero and tends to be lowered as the absolute value is larger. In thetable illustrated in FIG. 12, such a characteristic is reflected, and ashort code length is assigned to a value having a high occurrencefrequency. When the predictive quantization parameter is predicted to bea value close to the quantization parameter of the coding block, adifferential quantization parameter close to zero is calculated, wherebythe generated coding amount can be suppressed. The first bitstreamgeneration unit 112 extracts a bitstream corresponding to thedifferential quantization parameter from the table illustrated in FIG.12 and supplies the extracted bitstream to the bitstream multiplexingunit 115.

The operation of each of the units 220 of the moving picture decodingdevice 200 corresponding to the moving picture coding device 100according to this embodiment described above, which are surrounded bythe thick dotted line, will now be described.

In the units 220, first, the differential quantization parameter decodedby the first bitstream decoding unit 202 is supplied to the quantizationparameter generation unit 203. In addition, coding information otherthan the differential quantization parameter is stored in the codinginformation storage memory 204 as is necessary.

The quantization parameter generation unit 203 calculates a quantizationparameter of the decoding block by adding the differential quantizationparameter supplied from the first bitstream decoding unit 202 and thequantization parameter derived by the predictive quantization parameterderiving unit 205 and supplies the calculated quantization parameter tothe inverse quantization and inverse orthogonal transform unit 207 andthe coding information storage memory 204.

In the coding information storage memory 204, the quantization parameterof a decoded block is stored. In addition, not only the codinginformation in units of blocks decoded by the first bitstream decodingunit 202 but also coding information generated in units of pictures orslices is also stored therein as is necessary.

The predictive quantization parameter deriving unit 205 derives apredictive quantization parameter by using the quantization parameter orthe coding information of a decoded neighboring block disposed on theperiphery of the decoding block and supplies the derived predictivequantization parameter to the quantization parameter generation unit203. The quantization parameter calculated by the quantization parametergeneration unit 203 is stored in the coding information storage memory204, and, at the time of deriving the predictive quantization parameterof the next decoding block, a decoded neighboring block disposed on theperiphery of the decoding block is determined, and the quantizationparameter of the neighboring block is derived from the codinginformation storage memory 204. The quantization parameter of thedecoded neighboring block that is derived as above is the same as thequantization parameter derived from the coding information storagememory 113 by the predictive quantization parameter deriving unit 114 ofthe moving picture coding device 100. The predictive quantizationparameter deriving unit 205 has a function that is equivalent to that ofthe predictive quantization parameter deriving unit 114 of the movingpicture coding device 100, and accordingly, in a case where thequantization parameter of the neighboring block, which is supplied fromthe coding information storage memory 204, is the same, a predictivequantization parameter that is the same as the predictive quantizationparameter at the time of coding is derived.

The predictive quantization parameter deriving unit 205 performs thesame process except for changing a coded neighboring block to a decodedneighboring block, and thus, the description of the prediction of thequantization parameter will not be presented here.

In this way, the predictive quantization parameter derived on the codingside is derived also on the decoding side without any contradiction.

In this embodiment, in a case where the predictive quantizationparameter is derived, the neighboring block referred to by thepredictive quantization parameter deriving unit 114 of the movingpicture coding device 100 is a coded block, and the neighboring blockreferred to by the predictive quantization parameter deriving unit 205of the moving picture decoding device 200 is a decoded block. The codedblock that is referred to on the coding side is a block that is locallydecoded for the next coding operation inside the coding process and isthe same as the decoded block that is referred to on the decoding side.Accordingly, the functions of the predictive quantization parameterderiving units 114 and 205 are common, and predictive quantizationparameters derived thereby are the same. In examples to be describedbelow, the deriving of the predictive quantization parameter will bedescribed on the coding side as a common function without beingseparated into processes for coding and decoding.

Hereinafter, the method of deriving a predictive quantization parameterthat is performed to be common to the predictive quantization parameterderiving units 114 and 205 will be described in detail.

FIRST EXAMPLE

A detailed operation of the first predictive quantization parameterderiving unit 303 according to the first example will now be described.In the first example, in a case where a coding block that is a codingtarget is close to an upper tree block, while the quantization parameterof a coded block included in the upper tree block that is quite past inthe coding sequence is prohibited from being used for the prediction,the quantization parameter of a coded block of a tree block, which isneighboring to the left side, that is past in the coding sequence but isnot past long as the upper tree block is used for the prediction.

As illustrated in FIG. 13, coding is performed from the upper left sideto the lower right side of the screen in the raster scanning sequence inunits of tree blocks. Now, when a coding target tree block isrepresented by a hatched rectangle illustrated in FIG. 13, a coded treeblock is represented by a gray portion in FIG. 13. Inside the treeblock, hierarchical tree coding is performed in accordance with a codingcondition, and thus, the coding block is divided into parts of a sizethat is smaller than or equal to the size of the tree block.Accordingly, while the coding block disposed inside the coding targettree block and the coded block disposed inside the upper tree block arelocated close to each other, the blocks are separated far from eachother in the coding process sequence. Accordingly, the quantizationparameter calculated according to the coding amount control iscalculated in the coding process sequence, therefore, it cannot bedetermined that the quantization parameter of the coding block and thequantization parameter of the coded block disposed inside the upper treeblock have values close to each other. Thus, in the first example, theupper tree block is not used for the prediction of the quantizationparameter, but only the left tree block located close in the codingprocess sequence is used.

In addition, as illustrated in FIG. 14, when a coding block disposedinside a tree block is represented by a hatched rectangle illustrated inFIG. 14, a solid fine line represents the coding process sequence, andcoded blocks up to the coding block are represented as gray portions inFIG. 14. Inside the same tree block, the coding process sequences of thecoding block and the coded block are not separated from each other, andthe patterns thereof are frequently the same or are similar to eachother, and accordingly, it is effective to use the quantizationparameter of the upper coded block for a prediction inside the same treeblock. In the first example, a neighboring coded block is used for theprediction with high priority beyond the coded block that is locatedclose in the coding process sequence.

In FIG. 15, the direction of a coded block that is referred to by eachcoding block disposed inside a divided tree block is represented by athick arrow. The solid fine line illustrated in FIG. 15 represents thecoding process sequence, and a neighboring coded block is used with highpriority beyond the coded block that is located close in the codingprocess sequence for the coding block. The blocks BLK0 and BLK1 locatedat the upper end of a tree block in FIG. 15 are in contact with theboundary of an upper tree block, and accordingly, the quantizationparameter of the coded block that is neighboring to the upper side isnot used for the prediction, but only the quantization parameter of acoded block that is neighboring to the left side is used. Since blocksBLK2 and BLK3 have coded blocks neighboring to the upper side thereofbeing disposed inside the same tree block, the quantization parameter ofan upper coded block and the quantization parameter of a left codedblock are used for the prediction.

FIG. 16 illustrates the arrangement of a coding block and a coded blockneighboring to the periphery thereof that is defined in this embodiment.In this embodiment, for the convenience of description, while the sizesof blocks are represented to be the same, for example, by changing theblock size in a motion prediction or the like, even in a case where anoptimal motion prediction is made, an upper left point of the codingblock may be used as the reference, and a block that is neighboring tothe periphery thereof may be selected.

A symbol QPx (x=L, A, or AL) represented in FIG. 16 illustrates thequantization parameter of a coded neighboring block disposed on theperiphery. The first predictive quantization parameter deriving unit 303determines a predictive quantization parameter based on thepresence/no-presence of the quantization parameters of neighboringblocks disposed on the left side and the upper side illustrated in FIG.16.

The operation of the first predictive quantization parameter derivingunit 303 will now be described. FIG. 17 is a flowchart that illustratesthe operation of the first predictive quantization parameter derivingunit 303 of the first example.

First, the position information of a coding block that is the codingtarget is derived (step S100). As the position information of the codingblock, with the upper left side of the screen being used as a startingpoint, the position of the upper left side of a tree block including thecoding block is acquired, and the position of the coding block isacquired based on the position of the upper left side of the tree block.Next, it is determined whether or not the coding block is neighboring toan upper tree block (step S101).

In a case where the coding block is neighboring to the upper tree block(Yes in step S101), in other words, in a case where the coding block islocated at the upper end of the tree block, an upper neighboring blockis included in the upper tree block so as to be beyond the boundary ofthe tree block, and accordingly, the upper neighboring block is not usedfor the prediction of the quantization parameter. Here, considering thatthe quantization parameter always has a positive value, in a case wherethe upper neighboring block is not used, the quantization parameter QPAof the upper neighboring bock is set to zero (step S102).

On the other hand, in a case where the coding block is not neighboringto the upper tree block (No in step S101), in other words, in a casewhere the upper neighboring block is located within the tree block ofthe coding block, the quantization parameter QPA of the coded blockneighboring to the upper side of the coding block is derived from thememory 302 based on the reference position information of the upper leftside of the coding block (step S103). At this time, based on thereference position information of the upper left side of the codingblock, an access to a storage area arranged in the coding informationstorage memory 113 is made, the quantization parameter of thecorresponding neighboring coded block is supplied to the memory 302disposed inside the predictive quantization parameter deriving unit 114,and the quantization parameter of the upper neighboring block is derivedfrom the memory 302.

Subsequently, it is determined whether or not a coded block neighboringto the left side of the coding block is present (step S104). In a casewhere the block neighboring to the left side is present (Yes in stepS104), the quantization parameter QPL of the coded block that isneighboring to the left side of the coding block is derived from thememory 302 (step S105). On the other hand, in a case where the leftneighboring block is not present (No in step S104), the quantizationparameter QPL of the left neighboring block is set to zero (step S106).

Next, it is determined whether or not both the quantization parametersof left and upper neighboring blocks are positive (step S107). In a casewhere both the quantization parameters of the left and upper neighboringblocks are positive (Yes in step S107), the neighboring blocks disposedon both the left side and the upper side are present, and an averagevalue of the quantization parameters of the left and the upperneighboring blocks are set as the predictive quantization parameter(step S111). On the other hand, in a case where both the quantizationparameters of the left and upper neighboring blocks are not positive (Noin step S107), in other words, the quantization parameter of at leastone of the neighboring blocks of the left and the upper is zero, and theneighboring block of at least one of the left side and the upper side isnot present. In such a case, the process proceeds to step S108.

Next, it is determined whether both quantization parameters of the leftand upper neighboring blocks are zero (step S108). In a case where boththe quantization parameters of the left and the upper neighboring blocksare zero, both neighboring blocks are not present, and accordingly, thequantization parameters of the left and upper neighboring blocks cannotbe referred to as predictive quantization parameters. Thus, thequantization parameter prevQP of a block that is arranged previous tothe coding block, which is the coding target, or has been immediatelypreviously coded is set as the predictive quantization parameter. Inaddition, in a case where a block disposed at the upper left end of apicture is the coding block, the left and upper neighboring blocks and ablock that is arranged previous to the coding block, which is the codingtarget, or has been immediately previously coded are not present, andaccordingly, the quantization parameter of the picture or the slice isset as the predictive quantization parameter (step S109). In a casewhere one of the left and upper-side neighboring blocks is present, onequantization parameter having a positive value is set as the predictivequantization parameter (step S110). The predictive quantizationparameter calculated in this way is supplied to the differentialquantization parameter generation unit 111.

In addition, the first predictive quantization parameter deriving unit303 may determine the predictive quantization parameter based on thequantization parameters of the neighboring blocks disposed on the leftside, the upper side, and the upper left side of the coding blockillustrated in FIG. 16. A difference from the above-described techniqueis that the quantization parameters of the left and upper neighboringblocks are weighted based on the determination of the predictivequantization parameter, and a derived value is set as the predictivequantization parameter.

FIG. 18 is a flowchart that illustrates the operation of the firstpredictive quantization parameter deriving unit 303. The process ofsteps S200 to S210 of the flowchart illustrated in FIG. 18 are the sameas that of steps S100 to S110 of the above-described flowchartillustrated in FIG. 17, and description thereof will not be presentedhere, and the description will be started from a case where both thequantization parameters of the left and upper neighboring blocks havepositive values (Yes in step S207) in the determining of whether or notboth the quantization parameters of the left and upper neighboringblocks have positive values (step S207). In a case where both thequantization parameters of the left and upper neighboring blocks havepositive values, both the left and upper neighboring blocks are present.At this time, since the upper-left side neighboring block is alsopresent, an access to a storage area arranged in the coding informationstorage memory 113 is made based on the reference position informationof the upper left side of the coding block is made, and the quantizationparameter QPAL of the corresponding upper-left side neighboring block issupplied to the predictive quantization parameter deriving unit 114(step S211).

Next, it is determined whether or not the quantization parameter QPL ofthe left neighboring block and the quantization parameter QPAL of theupper-left side neighboring block coincide with each other (step S212).In a case where the quantization parameters QPL and QPAL coincide witheach other, when a weighting coefficient of the quantization parameterof the upper neighboring block is represented by FA, and a weightingcoefficient of the quantization parameter of the left neighboring blockis represented by FL, the weighting coefficient of the upper neighboringblock is set to be large such that FA>FL (step S213). For example, theweighting coefficient FA is set to 3, and the weighting coefficient FLis set to 1. In such a case, as an example, the arrangement of thequantization parameters illustrated in FIG. 8 may be considered, and itcan be determined that it is appropriate to set the weightingcoefficient of the quantization parameter of the upper neighboring blockto be large. In addition, in a case where the quantization parameter QPAalso coincides with the quantization parameters QPL and QPAL, thequantization parameters of all the neighboring blocks are the same, andthere is no problem. On the other hand, in a case where the quantizationparameters QPL and QPAL do not coincide with each other, the processproceeds to step S214, and it is determined whether the quantizationparameters QPA and QPAL coincide with each other (step S214). In a casewhere the quantization parameters QPA and QPAL coincide with each other,the weighting coefficient of the quantization parameter of the leftneighboring block is set to be large such that FA<FL (step S215). Forexample, FA is set to 1, and FL is set to 3. On the other hand, in acase where the quantization parameters QPA and QPAL do not coincide witheach other, the weighting coefficients FA and FL are weighted to be thesame, and the weighting coefficients of the quantization parameters ofthe left and upper neighboring blocks are equalized (step S216). In thiscase, since the quantization parameters of the left, the upper, and theupper-left side neighboring blocks are different from one another, asufficient condition for setting one of the weighing coefficients QPLand QPA to be large cannot be determined. Thus, an average of thequantization parameters QPL and QPA is set as an equal determinationvalue as the predictive quantization parameter, and, for example, theweighting coefficient FA is set to 2, and the weighting coefficient FLis set to 2. Then, a predictive quantization parameter predQP is derivedusing the following equation based on the determined weighingcoefficients and the quantization parameters (step S217).

$\begin{matrix}{{predQP} = \frac{{{FA} \times {QPA}} + {{FL} \times {QPL}} + 2}{4}} & \left\lbrack {{Expression}\mspace{14mu} 7} \right\rbrack\end{matrix}$

Here, the denominator of the equation represented above is “FA+FL”, and“2” included in the numerator is the value of (FA+FL)/2 that is addedfor rounding off. The predictive quantization parameter derived in thisway is supplied to the differential quantization parameter generationunit 111.

In addition, instead of the determination of coincidence between thequantization parameters QPL and QPAL of step S212 and the determinationof coincidence between the quantization parameters QPA and QPAL of stepS214, which are illustrated in FIG. 18, when the absolute value of adifference between the quantization parameters of the left andupper-left side neighboring blocks is represented by ΔL and the absolutevalue of a difference between the quantization parameters of the upperand upper-left side neighboring blocks is represented by ΔA, based onthe comparison between the values ΔL and ΔA, the left or upper sidequantization parameter may be set as the predictive quantizationparameter.

In the coding block and the coded neighboring block disposed on theperiphery thereof, ΔL and ΔA represent the absolute values ofdifferences between the quantization parameters of the left andupper-left side neighboring blocks and the upper and upper-left sideneighboring blocks and are respectively represented by the followingequations.

ΔL=|QPL−QPAL   [Expression 8]

ΔA=|QPA−QPAL   [Expression 9]

A case where ΔA is larger than ΔL is a case where a difference betweenthe quantization parameters QPA and QPAL is large, and, in that case, itis estimated that a difference between the smoothness levels or thecomplexity levels of pictures of the upper and upper-left sideneighboring blocks is larger (large change) than that of the left andupper-left side neighboring blocks. Accordingly, in the coding block andthe coded neighboring blocks disposed on the periphery thereof, it isconsidered that there is a difference between the quantizationparameters of the left two blocks (the left and upper-left sideneighboring blocks) and the right two blocks (the coding block and theupper neighboring block). Accordingly, it is determined that thequantization parameter of the coding block is closer to the quantizationparameter of the upper neighboring block than to the quantizationparameter of the left neighboring block.

In the case of the decoding process, by replacing the first predictivequantization parameter deriving unit 303 with the predictivequantization parameter deriving unit 205 and replacing the memory 302with the coding information storage memory 204 and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized.

SECOND EXAMPLE

The operations of the first predictive quantization parameter derivingunit 303 and 205 in the second example will now be described. While thecoding process will be described here, in the case of the decodingprocess, by paraphrasing coding with decoding, replacing the firstpredictive quantization parameter deriving unit 303 with the predictivequantization parameter deriving unit 205, replacing the memory 302 withthe coding information storage memory 204, and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized. In the second example, similarly to the first example, thequantization parameters of the left and upper coded blocks neighboringto the coding block that is the coding target are used for theprediction. A difference from the first example is that, similarly tothe case where the coding block is neighboring to the upper tree block,in a case where the coding block is neighboring to the left tree block,the quantization parameter of a coded block disposed inside the lefttree block is prohibited from being used for the prediction. The reasonfor this is that the calculation of the quantization parameter of thecoding block is performed based on the coding process sequence of thecoding control, and accordingly, the coding process sequences areseparated between the coding blocks of tree blocks than between thecoding blocks disposed inside a tree block, and, even in a case wherethe coding blocks are neighboring to each other between the tree blocks,the quantization parameters of the coding blocks calculated in thecoding amount control may not necessarily have values close to eachother and may not be appropriate as the predictive quantizationparameters. Thus, in the second example, in a case where the codingblock that is the coding target or the decoding target is neighboring tothe left or upper tree block, the quantization parameter of a codedblock disposed inside the left or upper tree block is not used for theprediction and is replaced with the quantization parameter of a blockthat is arranged previous to the coding block, which is the codingtarget, in the coding process sequence or has been immediatelypreviously coded so as to be used.

In FIG. 19, the direction of a coded block that is referred to by eachcoding block disposed inside a divided tree block is represented by athick arrow. The solid fine line illustrated in FIG. 19 represents thecoding process sequence, and the quantization parameter of a neighboringcoded block disposed inside a tree block including a coding block isused for the coding block as a general rule. A block BLK0 located at theupper end of the tree block illustrated in FIG. 20 has the boundarybeing in contact with left and upper tree blocks, and accordingly, thequantization parameter of a block arranged previous to a coding blockthat is the coding target or a block that has been immediatelypreviously coded replaces the quantization parameters of coded blocksthat are neighboring to the left side and the upper side so as to beused for the prediction. In addition, since a block BLK1 has theboundary being in contact with the upper tree block, the quantizationparameter of a coded block that is neighboring to the upper side is notused for the prediction but is replaced with a quantization parameter ofa block that is arranged previous to the coding block, which is thecoding target, or has been immediately previously coded, and thequantization parameter is used for the prediction together with thequantization parameter of a coded block neighboring to the left side.Since a block BLK2 has the boundary being in contact with the left treeblock, the quantization parameter of a coded block that is neighboringto the left side is not used for the prediction but is replaced with aquantization parameter of a block that is arranged previous to thecoding block, which is the coding target, or has been immediatelypreviously coded, and the quantization parameter is used for theprediction together with the quantization parameter of a coded blockneighboring to the upper side. In addition, for a block BLK3, sincecoded blocks that are neighboring to the left side and the upper sideare disposed inside the same tree block, the quantization parameters ofthe upper coded block and the quantization parameter of the left codedblock are used for the prediction.

FIG. 20 is a flowchart that illustrates the operation of the firstpredictive quantization parameter deriving unit 303 of the secondexample.

First, the position information of a coding block that is the codingtarget is derived (step S300). As the position information of the codingblock, with the upper left side of the screen being used as a startingpoint, the position of the upper left side of a tree block including thecoding block is acquired, and the position of the coding block isacquired based on the position of the upper left side of the tree block.Next, it is determined whether or not the coding block is neighboring toan upper tree block (step S301). In a case where the coding block isneighboring to the upper tree block (Yes in step S301), in other words,in a case where the coding block is located at the upper end of the treeblock, an upper neighboring block is included in the upper tree block soas to be beyond the boundary of the tree block, and accordingly, theupper neighboring block is not used for a prediction of the quantizationparameter but the quantization parameter prevQP of a coding block thatis arranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set to QPA (step S302).

On the other hand, in a case where the coding block is not neighboringto the upper tree block (No in step S301), in other words, in a casewhere the upper neighboring block is located within the same tree blockof the coding block, the quantization parameter QPA of the coded blockneighboring to the upper side of the coding block is derived from thememory 302 (step S303). At this time, based on the reference positioninformation of the upper left side of the coding block, an access to astorage area arranged in the coding information storage memory 113 ismade, the quantization parameter of the corresponding neighboring codedblock is supplied to the memory 302 disposed inside the predictivequantization parameter deriving unit 114, and the quantization parameterof the upper neighboring block is derived from the memory 302.

Subsequently, it is determined whether or not the coding block isneighboring to the left tree block (step S304). In a case where thecoding block is neighboring to the left tree block (Yes in step S304),in other words, in a case where the coding block is located at the leftend of the tree block, a block neighboring to the left side is includedinside a left tree block so as to be beyond the boundary of the treeblock, and accordingly, the left neighboring block is not used for aprediction of the quantization parameter but the quantization parameterprevQP of a coding block that is arranged previous to the coding block,which is the coding target, or has been immediately previously coded isset to QPL (step S306).

On the other hand, in a case where the coding block is not neighboringto the left tree block (No in step S304), in other words, in a casewhere the left neighboring block is located inside the tree block of thecoding block, the quantization parameter QPL of the coded block that isneighboring to the left side of the coding block is derived from thememory 302 (step S306). Finally, an average value of the quantizationparameters of the left and the upper neighboring blocks is set as thepredictive quantization parameter (step S307). The predictivequantization parameter calculated in this way is supplied to thedifferential quantization parameter generation unit 111.

In the second example, in a case where the left and upper neighboringblocks are beyond the boundary of the tree block, the quantizationparameter of a coding block that is arranged previous to the codingblock, which is the coding target, or has been immediately previouslycoded is substituted for the quantization parameters thereof, andnon-zero values are necessarily included. Accordingly, the process ofdetermining the value of the quantization parameter can be relativelyreduced, compared to the first example.

THIRD EXAMPLE

The operations of the first predictive quantization parameter derivingunit 303 and 205 in the third example will now be described. While thecoding process will be described here, in the case of the decodingprocess, by paraphrasing coding with decoding and replacing the firstpredictive quantization parameter deriving unit 303 with the predictivequantization parameter deriving unit 205 and replacing the memory 302with the coding information storage memory 204 and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized. A difference from the first example is that, similarly to thecase where the coding block that is the coding target or the decodingtarget is neighboring to the upper tree block, in a case where thecoding block is neighboring to the left tree block, the quantizationparameter of a coded block disposed inside the left tree block isprohibited from being used for the prediction. In other words, the useof the quantization parameter of a coded block that is beyond theboundary of the tree block for the prediction is limited only to a casewhere the quantization parameter of a block that is arranged previous tothe coding block, which is the coding target, or has been immediatelycoded is used for the coding block of the initial coding processsequence inside the tree block.

In FIG. 21, the direction of a coded block that is referred to by eachcoding block disposed inside a divided tree block is represented by athick arrow. The solid fine line illustrated in FIG. 21 represents thecoding process sequence, and the quantization parameter of a neighboringcoded block disposed inside a tree block including the coding block isused for the coding block.

A block BLK0 located at the upper end of the tree block illustrated inFIG. 21 has the boundary being in contact with left and upper treeblocks, and accordingly, only the quantization parameter of a block thatis arranged previous to a coding block, which is the coding target, orhas been immediately previously coded is used for the prediction. Inaddition, since a block BLK1 has the boundary being in contact with theupper tree block, the quantization parameter of a coded block that isneighboring to the upper side is not used for the prediction, but onlythe quantization parameter of a coded block that is neighboring to theleft side is used for the prediction. Since a block BLK2 has theboundary being in contact with the left tree block, the quantizationparameter of a coded block that is neighboring to the left side is notused for the prediction, but only the quantization parameter of thecoded block that is neighboring to the upper side is used for theprediction. In addition, for a block BLK3, since coded blocks that areneighboring to the left side and the upper side are disposed inside thesame tree block, the quantization parameters of the upper coded blockand the quantization parameter of the left coded block are used for theprediction.

FIG. 22 is a flowchart that illustrates the operation of the firstpredictive quantization parameter deriving unit 303 of the thirdexample. In FIG. 22, steps S400 to S403 and S407 to S411 of theflowchart are the same as steps S100 to S103 and S107 to S111 of thefirst example illustrated in FIG. 17, thus the description thereof willnot be presented here, and only a difference from step S404 after thedetermination of whether or not the coding block is neighboring to theupper tree block is made will be described.

After it is determined whether or not the coding block and the uppertree block are neighboring to each other, it is determined whether ornot the coding block is neighboring to the left tree block (step S404).In a case where the coding block is neighboring to the left tree block(Yes in step S404), in other words, in a case where the coding block islocated at the left end of the tree block, a block neighboring to theleft side is included inside a left tree block so as to be beyond theboundary of the tree block, and accordingly, the left neighboring blockis not used for a prediction of the quantization parameter. Here,considering that the quantization parameter always has a positive value,in a case where the left neighboring block is not used, the quantizationparameter QPL of the left neighboring bock is set to zero (step S405).On the other hand, in a case where the coding block is not neighboringto the left tree block (No in step S404), in other words, in a casewhere the left neighboring block is located within the same tree blockof the coding block, the quantization parameter QPL of the coded blockneighboring to the left side of the coding block is derived from thememory 302 (step S406). Then, a predictive quantization parameter isderived from the quantization parameters of the left and upperneighboring blocks that are derived in such a way, and the predictivequantization parameter is supplied to the differential quantizationparameter generation unit 111.

FOURTH EXAMPLE

The operations of the first predictive quantization parameter derivingunit 303 and 205 in the fourth example will now be described. While thecoding process will be described here, in the case of the decodingprocess, by paraphrasing coding with decoding, replacing the firstpredictive quantization parameter deriving unit 303 with the predictivequantization parameter deriving unit 205, replacing the memory 302 withthe coding information storage memory 204, and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized. In the fourth example, in a case where the coding block thatis the coding target or the decoding target is neighboring to the leftor the upper tree block, the quantization parameter of a coded blockdisposed inside the left or upper tree block is prohibited from beingused for the prediction. In addition, the quantization parameter of acoded block that is neighboring to the left side is used for theprediction as a general rule, and, in a case where the coded blockneighboring to the left side is not present or is present at a positionbeyond the boundary of the tree block, the quantization parameter of ablock that is arranged previous to the coding block, which is the codingtarget, or has been immediately previously coded is used for theprediction.

In FIG. 23, the direction of a coded block that is referred to by eachcoding block disposed inside a divided tree block is represented by athick arrow. The solid fine line illustrated in FIG. 23 represents thecoding process sequence, and the quantization parameter of a coded blockthat is neighboring to the left side inside a tree block including acoding block is used for the coding block as a general rule.

A block BLK0 located at the upper end of the tree block illustrated inFIG. 23 has the boundary being in contact with left and upper treeblocks, and accordingly, the quantization parameter of a block that isarranged previous to a coding block, which is the coding target, or hasbeen immediately previously coded is used. In addition, for blocks BLK1and BLK3, a coded block that is neighboring to the left side is disposedinside the same tree block, the quantization parameter of the left codedblock is used for the prediction. Since a block BLK2 has the boundarybeing in contact with the left tree block, the quantization parameter ofa coded block neighboring to the left side is not used for theprediction, and the quantization parameter of a block arranged previousto the coding block, which is the coding target, or has been immediatelypreviously coded is used for the prediction.

FIG. 24 is a flowchart that illustrates the operation of the firstpredictive quantization parameter deriving unit 303 of the fourthexample. First, the position information of a coding block that is thecoding target is derived (step S500). As the position information of thecoding block, with the upper left side of the screen being used as astarting point, the position of the upper left side of a tree blockincluding the coding block is acquired, and the position of the codingblock is acquired based on the position of the upper left side of thetree block. Next, it is determined whether or not the coding block isneighboring to a left tree block (step S501). In a case where the codingblock is neighboring to the left tree block (Yes in step S304), in otherwords, in a case where the coding block is located at the left end ofthe tree block, a left neighboring block is included in the left treeblock so as to be beyond the boundary of the tree block, andaccordingly, the left neighboring block is not used for the predictionof the quantization parameter but the quantization parameter prevQP of acoding block that is arranged previous to the coding block, which is thecoding target, or has been immediately previously coded is set as thepredictive quantization parameter (step S502). On the other hand, in acase where the coding block is not neighboring to the left tree block(No in step S501), in other words, in a case where the left neighboringblock is located within the same tree block of the coding block, thequantization parameter QPL of the coded block neighboring to the leftside of the coding block is derived from the memory 302 (step S503). Atthis time, based on the reference position information of the upper leftside of the coding block, an access to a storage area arranged in thecoding information storage memory 113 is made, the quantizationparameter of the corresponding neighboring coded block is supplied tothe memory 302 disposed inside the predictive quantization parameterderiving unit 114, and the quantization parameter of the leftneighboring block is derived from the memory 302 and is set as thepredictive quantization parameter. The predictive quantization parameterderived in this way is supplied to the differential quantizationparameter generation unit 111.

In the fourth example, since the quantization parameter of the leftcoded neighboring block of the coding block is used for the predictionas a general rule, the determination process is simplified compared tothe examples described until now, whereby the circuit scale can besuppressed.

FIFTH EXAMPLE

The operations of the first predictive quantization parameter derivingunits 303 and 205 in the fifth example will now be described. While thecoding process will be described here, in the case of the decodingprocess, by paraphrasing coding with decoding and replacing the firstpredictive quantization parameter deriving unit 303 with the predictivequantization parameter deriving unit 205, replacing the memory 302 withthe coding information storage memory 204, and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized. The fifth example is a combination of the first and secondexamples, and, in a case where a coding block that is the coding targetor the decoding target is neighboring to the left tree block, thequantization parameter of a coded block of the tree block that isneighboring to the left side is permitted to be used for the prediction.In a case where the coding block is neighboring to the upper tree block,the quantization parameter of a coded block disposed inside the uppertree block is prohibited from being used for the prediction, and,instead of the quantization parameter of the coded block disposed insidethe upper tree block, the quantization parameter of a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded is used for the prediction.

In FIG. 25, the direction of a coded block that is referred to by eachcoding block disposed inside a divided tree block is represented by athick arrow. The solid fine line illustrated in FIG. 25 represents thecoding process sequence, and a neighboring coded block is used with highpriority beyond the coded block that is located close in the codingprocess sequence for the coding block that is the coding target.

The blocks BLK0 and BLK1 located at the upper end of a tree block inFIG. 25 are in contact with the boundary of an upper tree block, andaccordingly, the quantization parameter of the coded block that isneighboring to the upper side is not used for the prediction, and,instead thereof, the quantization parameter of a block that is arrangedprevious to the coding block, which is the coding target, or has beenimmediately previously coded and the quantization parameter of a codedblock neighboring to the left side are used for the prediction. Sinceblocks BLK2 and BLK3 have coded blocks neighboring to the upper sidethereof being disposed inside the same tree block, the quantizationparameter of an upper coded block and the quantization parameter of aleft coded block are used for the prediction.

A detailed operation of the first predictive quantization parameterderiving unit 303 of the fifth example will now be described. FIG. 26 isa flowchart that illustrates the operation of the first predictivequantization parameter deriving unit 303 of the fifth example.

First, the position information of a coding block that is the codingtarget is derived (step S600). As the position information of the codingblock, with the upper left side of the screen being used as a startingpoint, the position of the upper left side of a tree block including thecoding block is acquired, and the position of the coding block isacquired based on the position of the upper left side of the tree block.Next, it is determined whether or not the coding block is neighboring toan upper tree block (step S601). In a case where the coding block isneighboring to the upper tree block (Yes in step S601), in other words,in a case where the coding block is located at the upper end of the treeblock, an upper neighboring block is included in the upper tree block soas to be beyond the boundary of the tree block, and accordingly, theupper neighboring block is not used for the prediction of thequantization parameter, but the quantization parameter PrevQP of acoding block that is arranged previous to the coding block, which is thecoding target, or has been immediately previously coded is set to QPA(step S602).

On the other hand, in a case where the coding block is not neighboringto the upper tree block (No in step S601), in other words, in a casewhere the upper neighboring block is located within the same tree blockof the coding block, the quantization parameter QPA of the coded blockneighboring to the upper side of the coding block is derived from thememory 302 (step S603). At this time, based on the reference positioninformation of the upper left side of the coding block, an access to astorage area arranged in the coding information storage memory 113 ismade, the quantization parameter of the corresponding neighboring codedblock is supplied to the memory 302 disposed inside the predictivequantization parameter deriving unit 114, and the quantization parameterof the upper neighboring block is derived from the memory 302.

Subsequently, it is determined whether or not a coded block neighboringto the left side of the coding block is present (step S604). In a casewhere the block neighboring to the left side is present (Yes in stepS604), based on the reference position information of the upper leftside of the coding block, an access to a storage area arranged in thecoding information storage memory 113 is made, and the quantizationparameter QPL of the corresponding left neighboring block is supplied tothe predictive quantization parameter deriving unit 114 (step S605). Onthe other hand, in a case where the left neighboring block is notpresent (No in step S604), the quantization parameter QPL of the leftneighboring block is set to zero (step S606).

Next, it is determined whether or not the quantization parameter of theleft neighboring block has a positive value (step S607). In a case wherethe quantization parameter of the left neighboring block has a positivevalue (Yes in step S607), the left neighboring block is present, andaccordingly, an average value of the quantization parameters of the leftand upper neighboring blocks are set as the predictive quantizationparameter (step S608). On the other hand, in a case where thequantization parameter of the left neighboring block is not positive (Noin step S607), in other words, the quantization parameter of the leftneighboring block is zero, and the left neighboring block is notpresent. In such a case, the parameter QPA is set as the predictivequantization parameter (step S609). The predictive quantizationparameter calculated in such a way is supplied to the differentialquantization parameter generation unit 111.

SIXTH EXAMPLE

The operations of the second predictive quantization parameter derivingunits 304 and 205 in the sixth example will now be described. While thecoding process will be described here, in the case of the decodingprocess, by paraphrasing coding with decoding and replacing the secondpredictive quantization parameter deriving unit 304 with the predictivequantization parameter deriving unit 205, replacing the memory 302 withthe coding information storage memory 204, and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized. In a case where the intra prediction is selected as theprediction mode of the coding block by the predicted picture generationunit 108, the second predictive quantization parameter deriving unit 304selects or derives a predictive quantization parameter based on theintra prediction mode representing the direction of pixels of aneighboring block that is referred to in the intra prediction.

FIG. 27 is a diagram that illustrates relation between the predictiondirection of then intra prediction mode and the left and upperneighboring blocks selected as the predictive quantization parameters ina case where the prediction mode of the coding block is the intraprediction. In the intra prediction, a prediction signal is generatedfrom a pixel of a neighboring block of a prediction directionrepresented by the intra prediction mode, and an intra prediction modehaving high coding efficiency and a small strain amount is selected.Accordingly, it is determined that the correlation with the upperneighboring block is high in a case where the upper side is selected inaccordance with the intra prediction mode, and the correlation with theleft neighboring block is high in a case where the left side is selectedin accordance with the intra prediction mode. In a case where thecorrelation between blocks is high, the patterns and the complexitylevels (activity levels) of the inside of the blocks are similar to eachother, and the quantization parameters calculated based on theactivities have values close to each other. Thus, in this the sixthexample, in order to code and transmit the quantization parameter of thecoding block with high efficiency, a neighboring block having highcorrelation with the coding block is predicted and determined based onthe intra prediction mode, and the quantization parameter of thedetermined neighboring block is selected as a predictive quantizationparameter.

FIG. 28 is a flowchart that illustrates the operation of the secondpredictive quantization parameter deriving unit 304 of the sixthexample. In the sixth example, in a case where the coding block isneighboring to the upper tree block, while the quantization parameter ofa coded block disposed inside the upper tree block is prohibited frombeing used for the prediction, the quantization parameter of a codedblock of a tree block neighboring to the left side is used for theprediction.

First, the position information of a coding block that is the codingtarget is derived (step S700). As the position information of the codingblock, with the upper left side of the screen being used as a startingpoint, the position of the upper left side of a tree block including thecoding block is acquired, and the position of the coding block isacquired based on the position of the upper left side of the tree block.Next, it is determined whether or not the coding block is neighboring toan upper tree block (step S701).

In a case where the coding block is neighboring to the upper tree block(Yes in step S701), in other words, in a case where the coding block islocated at the upper end of the tree block, an upper neighboring blockis included in the upper tree block so as to be beyond the boundary ofthe tree block, and accordingly, the upper neighboring block is not usedfor the prediction of the quantization parameter. Here, considering thatthe quantization parameter always has a positive value, in a case wherethe upper neighboring block is not used, the quantization parameter QPAof the upper neighboring bock is set to zero (step S702).

On the other hand, in a case where the coding block is not neighboringto the upper tree block (No in step S701), in other words, in a casewhere the upper neighboring block is located within the same tree blockof the coding block, the quantization parameter QPA of the coded blockneighboring to the upper side of the coding block is derived from thememory 302 (step S703). At this time, based on the reference positioninformation of the upper left side of the coding block, an access to astorage area arranged in the coding information storage memory 113 ismade, the quantization parameter of the corresponding neighboring codedblock is supplied to the memory 302 disposed inside the predictivequantization parameter deriving unit 114, and the quantization parameterof the upper neighboring block is derived from the memory 302.

Subsequently, it is determined whether or not a coded block neighboringto the left side of the coding block is present (step S704). In a casewhere the block neighboring to the left side is present (Yes in stepS704), the quantization parameter QPL of the coded block that isneighboring to the left side of the coding block is derived from thememory 302 (step S705). On the other hand, in a case where the leftneighboring block is not present (No in step S704), the quantizationparameter QPL of the left neighboring block is set to zero (step S706).

Next, it is determined whether or not both the quantization parametersof left and upper neighboring blocks are positive (step S707). In a casewhere both the quantization parameters of the left and upper neighboringblocks are positive (Yes in step S707), the neighboring blocks disposedon both the left side and the upper side are present. Accordingly, byreferring to a neighboring block designated by the prediction directionrepresented in the intra prediction mode, the quantization parameter canbe derived, and, in such a case, a prediction determination is madebased on the prediction direction represented by the intra predictionmode.

On the other hand, in a case where both the quantization parameters ofthe left and upper neighboring blocks are not positive (No in stepS707), in other words, in a case where the quantization parameter of atleast one of the left and upper neighboring blocks is zero, at least oneof the left and upper neighboring blocks is not present. Accordingly,the neighboring block designated by the prediction direction representedby the intra prediction mode may not be present, and thus, in such acase, the prediction determination that is based on the predictiondirection represented by the intra prediction mode is not made, but itis determined whether or not the left or upper neighboring block ispresent, in other words, whether or not the quantization parameter theleft or upper neighboring block is zero. First, it is determined whetheror not the quantization parameter of the upper neighboring block is zero(step S710). In a case where the quantization parameter of the upperneighboring block is not zero (No in step S710), the quantizationparameter of the upper neighboring block is set as a predictivequantization parameter (step S711). On the other hand, in a case wherethe quantization parameter of the upper neighboring block is zero (Yesin step S710), the quantization parameter of the upper neighboring blockcannot be referred to as a predictive quantization parameter, and theprocess proceeds to the determination process of step S712. Next, it isdetermined whether or not the quantization parameter of the leftneighboring block is zero (step S712). In a case where the quantizationparameter of the left neighboring block is not zero (No in step S712),the quantization parameter of the left neighboring block is set as apredictive quantization parameter (step S713). On the other hand, in acase where the quantization parameter of the left neighboring block iszero (Yes in step S712), in other words, in a case where thequantization parameters of the left and upper neighboring blocks arezero, the quantization parameters of both the blocks are not present,and accordingly, the quantization parameters of the left and upperneighboring blocks cannot be referred to as the predictive quantizationparameter. Thus, the quantization parameter prevQP of a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set as a predictivequantization parameter. In addition, in a case where a block disposed atthe upper left end of the picture is the coding block, the left andupper neighboring blocks and furthermore a block arranged previous tothe coding block, which is the coding target, or has been immediatelypreviously coded are not present, and accordingly, the quantizationparameter of the picture or the slice is set as the predictivequantization parameter (step S714).

Returning to the determination process of step S707, in a case whereboth the quantization parameters of the left and upper neighboringblocks are positive (Yes in step S707), an intra prediction modeintraPredMode of the coding block is derived from the memory 302.Similarly to the derivation of the quantization parameter of theneighboring coded block, an access to a storage area arranged in thecoding information storage memory 113 is made based on the referenceposition information of the upper left side of the coding block, and theintra prediction mode is supplied to the memory 302 and is derived fromthe memory 302.

The intra prediction mode is a number that is assigned to a predictiondirection illustrated in FIG. 27. In order to allow the followingdetermination process to be easily performed, the intra prediction modeis converted into an intra prediction direction (hereinafter, referredto as intraPredDirec) using the conversion table illustrated in FIG. 29.The intra prediction direction may be assigned such thatintraPredDirec=0 is assigned to an average value predictionintraPredMode=2 that is predicted by calculating an average value fromneighboring decoded blocks in the intra prediction, and the otherintraPredDirec 1 to 33 are assigned to the upper right sideintraPredMode=6 of the prediction direction of the intra prediction modeillustrated in FIG. 30 toward the lower left side intraPredMode=9. Thederived intra prediction mode is converted into the intra predictiondirection using this conversion table (step S708). The quantizationparameter is predicted based on the converted intra prediction direction(step S709). As a threshold of the prediction direction of the intraprediction mode illustrated in FIG. 30, TH is set, here, the thresholdTH is set to 18 as the value of the intra prediction direction. Thequantization parameter of the upper neighboring block is derived as thepredictive quantization parameter in a case where the intra predictiondirection is smaller than 18, and the quantization parameter of the leftneighboring block is derived as the predictive quantization parameter ina case where the intra prediction direction is larger than or equal to18.

A detailed operation of the prediction of the quantization parameteraccording to the intra prediction direction will be described withreference to FIG. 31. First, it is determined whether or not theconverted intra prediction direction is zero (step S720). The intraprediction direction is zero in a case where an intra predictionaccording to an average value prediction is made (Yes in step S720). Insuch a case, any one of the left neighboring block and the upperneighboring block is not selected with higher priority, but an averagevalue of the quantization parameters QPL and QPA of the left and upperneighboring blocks is set as the predictive quantization parameter (stepS721). On the other hand, in a case where the intra prediction directionis not zero (No in step S720), it is determined whether or not the intraprediction direction is smaller than 18 (step S722). In a case where theintra prediction direction is smaller than 18 (Yes in step S722), asillustrated in FIG. 27, the upper neighboring block is referred to, andthe quantization parameter QPA of the upper neighboring block is set asthe predictive quantization parameter (step S723). On the other hand, ina case where the intra prediction direction is larger than or equal to18 (No in step S722), the left neighboring block is referred to, and thequantization parameter QPL of the left neighboring block is set as thepredictive quantization parameter (step S724). The predictivequantization parameter derived in this way is supplied to thedifferential quantization parameter generation unit 111.

As above, in the second predictive quantization parameter deriving unit304 of the sixth example, while the quantization parameter of the leftor upper neighboring block is derived as the predictive quantizationparameter based on the determination of the prediction direction of theintra prediction mode illustrated in FIG. 30, a weighted average valuederived by weighting the quantization parameters of the left and upperneighboring blocks may be set as the predictive quantization parameter.

When the weighting coefficient of the quantization parameter of theupper neighboring block is represented by FA, and the weightingcoefficient of the quantization parameter of the left neighboring blockis represented by FL, TH (=18) is set as the threshold for theprediction direction of the intra prediction mode illustrated in FIG.32, the weighting coefficient is set to be large for the quantizationparameter of the upper neighboring block such that FA>FL in a case wherethe intra prediction direction is smaller than 18, and the weightingcoefficient is set to be large for the quantization parameter of theleft neighboring block such that FA<FL in a case where the intraprediction direction is larger than or equal to 18.

FIG. 33 is a diagram that illustrates a detailed operation of theprediction of the quantization parameter (step S709) according to theintra prediction direction illustrated in FIG. 28 that is a flowchartillustrating the operation of the second predictive quantizationparameter deriving unit 304.

First, it is determined whether or not the converted intra predictiondirection is zero (step S730). The intra prediction direction is zero ina case where an intra prediction according to the average valueprediction is made (Yes in step S730). In such a case, one of the leftand upper neighboring blocks is not selected with higher priority, butthe weighting coefficients FL and FA of the quantization parameters ofthe left and upper neighboring blocks are set to a same value (stepS731). For example, it is set such that FA=FL=2. On the other hand, in acase where the intra prediction direction is not zero (No in step S730),it is determined whether or not the intra prediction direction issmaller than 18 (step S732). In a case where the intra predictiondirection is smaller than 18 (Yes in step S732), the weightingcoefficient of the quantization parameter of the upper neighboring blockis set to be large such that FA>FL (step S733). For example, FA is setto 3, and FL is set to 1. On the other hand, in a case where the intraprediction direction is larger than or equal to 18 (No in step S732),the weighting coefficient of the quantization parameter of the leftneighboring block is set to be large such that FA<FL (step S734). Forexample, FA is set to 1, and FL is set to 3.

A predictive quantization parameter predQP is derived using thefollowing equation based on the weighting coefficients and thequantization parameters determined as above (step S735).

$\begin{matrix}{{predQP} = \frac{{{FA} \times {QPA}} + {{FL} \times {QPL}} + 2}{4}} & \left\lbrack {{Expression}\mspace{14mu} 10} \right\rbrack\end{matrix}$

Here, the denominator of the equation represented above is “FA+FL”, and“2” included in the numerator is the value of (FA+FL)/2 that is addedfor rounding off. The predictive quantization parameter derived in thisway is supplied to the differential quantization parameter generationunit 111.

Here, as combinations of the weighting coefficients FA and FL, while itis set such that (FA, FL)=(3, 1), (2, 2), and (1, 3), other coefficientsmay be set. However, in a case where the calculation speed is ofsignificance, variables may be selected such that FA+FL is representedas the power of 2. By performing bit shifting of the deriving equationfor the above-described predictive quantization parameter, the followingequation is acquired.

predQP=(FA×QPA+FL×QPL+2)>>2   [Expression 11]

In addition, as a combination of the weighting coefficients FA and FL,in a case where (FA, FL)=(3, 1) is changed to (FA, FL)=(4, 0) and a casewhere (FA, FL)=(1, 3) is changed to (FA, FL)=(0, 4), the former caserepresents the upper neighboring block, and the latter case representsthe left neighboring block, which is the same result as the sixthexample. However, in the sixth example, a calculation process isperformed only in a case where an average value of QPA and QPL iscalculated, and, in a case where an average value is not set as thepredictive quantization parameter, the quantization parameter of theleft or upper neighboring block may be selected, whereby the process canbe simplified and can be performed at high speed.

In addition, in the sixth example, for the reference determination ofthe quantization parameter of the left or upper neighboring block, whilethe threshold TH of the intra prediction direction is set to 18, a valueother than this value may be used, and the threshold may be implicitlyset as long as there is no contradiction between the moving picturecoding device 100 and the moving picture decoding device 200. Inaddition, the threshold of the intra prediction direction may be set inheader information and be changed in units of sequences, pictures,slices, or the like.

Furthermore, the number of thresholds of the prediction direction of theintra prediction mode may be increased, and the weighting coefficientsof the quantization parameters of the left and upper neighboring blocksmay be changed and set for each of ranges of the area of the predictiondirection of the intra prediction mode that are delimited by thresholds.

FIG. 34 is a diagram that illustrates an example in which the predictiondirections of the intra prediction modes are divided into three areasusing thresholds THLO and THHI. The thresholds THLO and THHI areillustrated by thick dotted lines in FIG. 34 and are set to have thesame weighting coefficient in ranges delimited by the thresholds. In anintra prediction mode positioned to the right side of the thresholdTHLO, an intra prediction is made by using pixel signals of coded blocksthat are mainly neighboring to the upper side of the coding block, andaccordingly, the correlation with the upper neighboring block is high.On the other hand, in an intra prediction mode positioned on the lowerside of the threshold THHI, an intra prediction is made by using pixelsignals of coded blocks that are mainly neighboring to the left side ofthe coding block, and accordingly, the correlation with the leftneighboring block is high. Accordingly, the weighting coefficient of thequantization parameter of the upper neighboring block is set to be large(FA>FL) in a case where the intra prediction mode is positioned on theright side of the threshold THLO, and the weighting coefficient of thequantization parameter of the left neighboring block is set to be large(FA<FL) in a case where the intra prediction mode is positioned on thelower side of the threshold THHI. In addition, in an intra predictionmode positioned between the thresholds THLO and THHI, in order not to bebiased to one of the coded blocks neighboring to the left and the upperof the coding block, the weighting coefficients of the quantizationparameters of the left and upper neighboring blocks are set to be equal(FA=FL). Here, the thresholds THLO and THHI are values of the intraprediction directions, and, in the sixth example, the threshold THLO isset to 13, and the threshold THHI is set to 22.

FIG. 35 is a diagram that illustrates a detailed operation of theprediction (step S709) of the quantization parameter according to theintra prediction direction illustrated in FIG. 28 that is the flowchartillustrating the operation of the second predictive quantizationparameter deriving unit 304.

First, it is determined whether or not the converted intra predictiondirection is zero (step S740). The intra prediction direction is zero ina case where an intra prediction according to the average valueprediction is made (Yes in step S740). In such a case, one of the leftand upper neighboring blocks is not selected with higher priority, butthe weighting coefficients FL and FA of the quantization parameters ofthe left and upper neighboring blocks are set to a same value (stepS741). For example, it is set such that FA=FL=2. On the other hand, in acase where the intra prediction direction is not zero (No in step S740),first, it is determined whether or not the intra prediction direction issmaller than the threshold THLO (step S742). In a case where the intraprediction direction is smaller than the threshold THLO (Yes in stepS742), the weighting coefficient of the quantization parameter of theupper neighboring block is set to be large such that FA>FL (step S743).For example, FA is set to 3, and FL is set to 1. On the other hand, in acase where the intra prediction direction is larger than or equal to thethreshold THLO (No in step S742), it is determined whether or not theintra prediction direction is smaller than the threshold THHI (stepS744). In a case where the intra prediction direction is not smallerthan the threshold THHI, in other words, in a case where the intraprediction direction is larger than or equal to the threshold THHI (Noin step S744), the weighing coefficient of the quantization parameter ofthe left neighboring block is set to be large such that FA<FL (stepS745). For example, FA is set to 1, and FL is set to 3. In a case wherethe intra prediction direction is smaller than the threshold THHI (Yesin step S744), the weighting coefficients of the quantization parametersof the left and upper neighboring blocks are set to be equal, and theprocess proceeds to step S741.

A predictive quantization parameter predQP is derived using thefollowing equation based on the weighting coefficients and thequantization parameters determined as above (step S746).

$\begin{matrix}{{predQP} = \frac{{{FA} \times {QPA}} + {{FL} \times {QPL}} + 2}{4}} & \left\lbrack {{Expression}\mspace{14mu} 12} \right\rbrack\end{matrix}$

Here, the denominator of the equation represented above is “FA+FL”, and“2” included in the numerator is the value of (FA+FL)/2 that is addedfor rounding off. The predictive quantization parameter derived in thisway is supplied to the differential quantization parameter generationunit 111.

Here, as combinations of the weighting coefficients FA and FL, while itis set such that (FA, FL)=(3, 1), (2, 2), and (1, 3), other coefficientsmay be set. However, in a case where the calculation speed is ofsignificance, variables may be selected such that FA+FL is representedas the power of 2. By performing bit shifting of the deriving equationfor the above-described predictive quantization parameter, the followingequation is acquired.

predQP=(FA+QPA+FL×QPL+2)>>2   [Expression 13]

As a combination of the weighting coefficients FA and FL describedabove, in a case where (FA, FL)=(3, 1) is changed to (FA, FL)=(4, 0) anda case where (FA, FL)=(1, 3) is changed to (FA, FL)=(0, 4), the formercase represents the upper neighboring block, and the latter caserepresents the left neighboring block. In such a case, a calculationprocess for calculating an average value of QPA and QPL is performed ina prediction direction of an intra prediction mode positioned betweenthe thresholds THLO and THHI, and in the other cases where the averagevalue is not set as the predictive quantization parameter, thequantization parameter of the left or upper neighboring block may beselected. Accordingly, the process can be simplified and can beperformed at high speed.

In addition, in the sixth example, while the thresholds THLO and THHIare respectively set to 13 and 22 as values of intra predictiondirections, any other values may be used, and the thresholds may beimplicitly set as long as there is no contradiction between the movingpicture coding device 100 and the moving picture decoding device 200.

Furthermore, in the sixth example, while the prediction directions ofthe intra prediction modes are divided into three areas at thethresholds THLO and THHI, the number of the thresholds may be increasedso as to increase the number of divisions. However, in a case where thecalculation speed is of significance, it is preferable to selectvariables as the weighting coefficients FA and FL such that FA+FL isrepresented as the power of 2.

In addition, in the sixth example, in a case where the coding block isneighboring to the upper tree block, it has been described that thequantization parameter of a coded block disposed inside the upper treeblock is prohibited from being used for the prediction, and thequantization parameter of a coded block of the tree block neighboring tothe left side is used for the prediction. However, the present inventionmay be applied also to a case where the quantization parameter of acoded block disposed inside the left tree block in addition to that ofthe upper tree block is prohibited from being used for the prediction.In such a case, it can be realized by only replacing “upper side” with“left side” in the determination of being neighboring of the upper treeblock of steps S701 to S703 and changing QPA to QPL in the determinationbranching of steps S704 to S706.

SEVENTH EXAMPLE

The operations of the second predictive quantization parameter derivingunits 304 and 205 in the seventh example will now be described. Whilethe coding process will be described here, in the case of the decodingprocess, by paraphrasing coding with decoding, replacing the secondpredictive quantization parameter deriving unit 304 with the predictivequantization parameter deriving unit 205, replacing the memory 302 withthe coding information storage memory 204, and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized. Similarly to the sixth example, in the seventh example, thequantization parameters of the left and upper coded blocks neighboringto the coding block are used for the prediction. A difference from thesixth example is that, similarly to the case where the coding block isneighboring to the upper tree block, in a case where the coding block isneighboring to the left tree block, the quantization parameter of acoded block disposed inside the left tree block is prohibited from beingused for the prediction. The reason for this is that the calculation ofthe quantization parameter of the coding block is performed based on thecoding process sequence of the coding control, and accordingly, thecoding process sequences are separated between the coding blocks of treeblocks than between the coding blocks disposed inside a tree block, and,even in a case where the coding blocks are neighboring to each otherbetween the tree blocks, the quantization parameters of the codingblocks calculated in the coding amount control may not necessarily havevalues close to each other and may not be appropriate as the predictivequantization parameters. Thus, in the seventh example, similarly to thesecond example, in a case where the coding block that is the codingtarget or the decoding target is neighboring to the left or upper treeblock, the quantization parameter of a coded block disposed inside theleft or upper tree block is not used for the prediction and is replacedwith the quantization parameter of a block that is arranged previous tothe coding block, which is the coding target, in the coding processsequence or has been immediately previously coded so as to be used.

FIG. 36 is an enlarged diagram of the periphery of the coding block BLK1of the inside of the divided tree block illustrated in FIG. 19. Thedirection of a coded block that is referred to by the coding block BLK1illustrated in FIG. 36 is represented by a thick arrow. The solid fineline illustrated in FIG. 36 represents the coding process sequence, andthe quantization parameter of a neighboring coded block disposed insidea tree block including a coding block is used for the coding block as ageneral rule. In addition, since a block BLK1 has the boundary being incontact with the upper tree block, the quantization parameter of a codedblock that is neighboring to the upper side is not used for theprediction but is replaced with a quantization parameter prevQP of ablock that is arranged previous to the coding block, which is the codingtarget, or has been immediately previously coded, and the quantizationparameter is used for the prediction together with the quantizationparameter of a coded block neighboring to the left side. Here, for theblock BLK1, an intra prediction is determined as the prediction mode,and, when the intra prediction mode is assumed to be 23, the predictiondirection of the intra prediction mode is represented by a thick dottedline illustrated in FIG. 36. In a case where the intra prediction modeis 23, the prediction direction is the upward direction, andaccordingly, the upper neighboring block is determined to be referredto. However, since the block BLK1 has the boundary being in contractwith the upper tree block, the quantization parameter of the upperneighboring block cannot be referred to, and the replacing quantizationparameter of a block that is arranged previous to the coding block,which is the coding target, or has been immediately previously coded isreferred to. The quantization parameter of the block that is arrangedprevious to the coding block, which is the coding target, or has beenimmediately previously coded is different from the quantizationparameter of the upper neighboring block that is actually determined inthe prediction direction of the intra prediction mode but is aquantization parameter that is the closest in the coding processsequence, and accordingly, deterioration of the accuracy of thepredictive quantization parameter can be suppressed as much as possible.In addition, by replacing the quantization parameters of the left andupper neighboring block that is neighboring to the coding block with thequantization parameter of the block that is arranged previous to thecoding block, which is the coding target, or has been immediatelypreviously coded, non-zero quantization parameters are always present inthe left and upper neighboring blocks, and accordingly, unlike the sixthexample, switching between the prediction of the quantization parameterbased on the intra prediction mode and another process based on whetheror not both the quantization parameters of the left and upperneighboring blocks are present does not need to be performed, and thedetermination branching is not necessary. Accordingly, the determinationprocess of the prediction of the quantization parameter can beconfigured to be simpler than that of the sixth example.

FIG. 37 is a flowchart that illustrates the operation of the secondpredictive quantization parameter deriving unit 304 of the seventhexample.

First, the position information of a coding block that is the codingtarget is derived (step S800). As the position information of the codingblock, with the upper left side of the screen being used as a startingpoint, the position of the upper left side of a tree block including thecoding block is acquired, and the position of the coding block isacquired based on the position of the upper left side of the tree block.Next, it is determined whether or not the coding block is neighboring toan upper tree block (step S801). In a case where the coding block isneighboring to the upper tree block (Yes in step S801), in other words,in a case where the coding block is located at the upper end of the treeblock, an upper neighboring block is included in the upper tree block soas to be beyond the boundary of the tree block, and accordingly, theupper neighboring block is not used for a prediction of the quantizationparameter but the quantization parameter prevQP of a coding block thatis arranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set to QPA (step S802). On theother hand, in a case where the coding block is not neighboring to theupper tree block (No in step S801), in other words, in a case where theupper neighboring block is located within the same tree block of thecoding block, the quantization parameter QPA of the coded blockneighboring to the upper side of the coding block is derived from thememory 302 (step S803). At this time, based on the reference positioninformation of the upper left side of the coding block, an access to astorage area arranged in the coding information storage memory 113 ismade, the quantization parameter of the corresponding neighboring codedblock is supplied to the memory 302 disposed inside the predictivequantization parameter deriving unit 114, and the quantization parameterof the upper neighboring block is derived from the memory 302.

Subsequently, it is determined whether or not the coding block isneighboring to the left tree block (step S804). In a case where thecoding block is neighboring to the left tree block (Yes in step S804),in other words, in a case where the coding block is located at the leftend of the tree block, a block neighboring to the left side is includedinside a left tree block so as to be beyond the boundary of the treeblock, and accordingly, the left neighboring block is not used for aprediction of the quantization parameter, but the quantization parameterprevQP of a coding block that is arranged previous to the coding block,which is the coding target, or has been immediately previously coded isset to QPL (step S805). On the other hand, in a case where the codingblock is not neighboring to the left tree block (No in step S804), inother words, in a case where the left neighboring block is locatedinside the same tree block of the coding block, the quantizationparameter QPL of the coded block that is neighboring to the left side ofthe coding block is derived from the memory 302 (step S806).

Next, the intra prediction mode intraPredMode of the coding block isderived from the memory 302, and the intra prediction mode is convertedinto an intra prediction direction intraPredDirec (step S807). Theconversion into the intra prediction direction is the same as that ofthe sixth example, and the description thereof will not be presentedhere. The quantization parameter is predicted based on the convertedintra prediction direction (step S808). Here, similarly to the sixthexample, the threshold TH of the prediction direction of the intraprediction mode illustrated in FIG. 30 is set to a value of the intraprediction mode of 18, and the quantization parameter of the upperneighboring block is derived as the predictive quantization parameter ina case where the intra prediction direction is smaller than 18, and thequantization parameter of the left neighboring block is derived as thepredictive quantization parameter in a case where the intra predictiondirection is larger than or equal to 18.

A detailed operation of the prediction of the quantization parameteraccording to the intra prediction direction will be described withreference to FIG. 38. First, it is determined whether or not theconverted intra prediction direction is zero (step S810). The intraprediction direction is zero in a case where an intra predictionaccording to an average value prediction is made (Yes in step S810). Insuch a case, any one of the left neighboring block and the upperneighboring block is not selected with higher priority, but an averagevalue of the quantization parameters QPL and QPA of the left and upperneighboring blocks is set as the predictive quantization parameter (stepS811). On the other hand, in a case where the intra prediction directionis not zero (No in step S810), it is determined whether or not the intraprediction direction is smaller than 18 (step S812). In a case where theintra prediction direction is smaller than 18 (Yes in step S812), theupper neighboring block is referred to, and the quantization parameterQPA of the upper neighboring block is set as the predictive quantizationparameter (step S813). On the other hand, in a case where the intraprediction direction is larger than or equal to 18 (No in step S812),the left neighboring block is referred to, and the quantizationparameter QPL of the left neighboring block is set as the predictivequantization parameter (step S814). The predictive quantizationparameter derived in this way is supplied to the differentialquantization parameter generation unit 111.

As illustrated in FIG. 38, the prediction (step S808) of thequantization parameter that is based on the intra prediction directionof the seventh example is the same as the prediction (step S709) of thequantization parameter that is based on the intra prediction directionof the sixth example. Accordingly, in the sixth example, in a case wherethe weighting coefficients of the quantization parameters of the leftand upper neighboring blocks are set in accordance with the predictiondirection of the intra prediction mode, as illustrated in FIG. 34, evenin a case where the number of thresholds of the prediction direction ofthe intra prediction mode is increased, and the weighting coefficientsof the quantization parameters of the left and upper neighboring blocksare set for each range of the area of the prediction direction of theintra prediction mode that is delimited by thresholds, the process ofthe seventh example can be similarly performed, and the descriptionthereof will not be presented here.

EIGHTH EXAMPLE

The operations of the second predictive quantization parameter derivingunits 304 and 205 in the eighth example will now be described. While thecoding process will be described here, in the case of the decodingprocess, by paraphrasing coding with decoding, replacing the secondpredictive quantization parameter deriving unit 304 with the predictivequantization parameter deriving unit 205, replacing the memory 302 withthe coding information storage memory 204, and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized. A difference from the first example is that, similarly to thecase where the coding block that is the coding target or the decodingtarget is neighboring to the upper tree block, in a case where thecoding block is neighboring to the left tree block, the quantizationparameter of a coded block disposed inside the left tree block isprohibited from being used for the prediction. In other words, the useof the quantization parameter of a coded block that is beyond theboundary of the tree block for the prediction is limited only to a casewhere the quantization parameter of a block that is arranged previous tothe coding block, which is the coding target, or has been immediatelycoded is used for the coding block of the initial coding processsequence inside the tree block. In addition, before the prediction ofthe quantization parameter according to the intra prediction directionis made, in a case where both the left and upper coded neighboringblocks are not present at locations beyond the boundary of the treeblock, in other words, the determination of whether or not thequantization parameters of the left and upper neighboring blocks arenon-zero is omitted, and, by directly predicting the quantizationparameter according to the intra prediction mode, the determinationprocess (steps S710 to S714) of a case where the prediction of thequantization parameter according to the intra prediction mode is notperformed in the sixth example is eliminated.

In the eighth example, in a case where a neighboring block determined inthe prediction direction of the intra prediction mode is not present ata position beyond the boundary of the tree block, a predictivequantization parameter is derived from the quantization parameter of thedetermined neighboring block. On the other hand, in a case where theneighboring block determined in the prediction direction of the intraprediction mode is present at a position beyond the boundary of the treeblock, the quantization parameter of the determined neighboring blockcannot be used. Accordingly, it is determined whether the quantizationparameter of the other neighboring block or the quantization parameterof a block that is arranged previous to the coding block, which is thecoding target, or has been immediately previously coded is valid, andthe quantization parameter determined to be valid is derived as apredictive quantization parameter.

FIG. 39 is a flowchart that illustrates the operation of the firstpredictive quantization parameter deriving unit 303 of the eighthexample. Steps S900 to S903 and S907 of the flowchart illustrated inFIG. 39 are the same as steps S700 to S703 and S708 of the sixth exampleillustrated in FIG. 28, and steps S904 to S906 are the same as stepsS804 to S806 of the seventh example illustrated in FIG. 37, and thus thedescription thereof will not be presented here, and only the detailedoperation of the prediction of the quantization parameter according tothe intra prediction direction that is made in step S908 will bedescribed.

A detailed operation of the prediction of the quantization parameteraccording to the intra prediction direction, which is performed (stepS908), will be described with reference to FIG. 40. Here, similarly tothe sixth example, the threshold TH of the prediction direction of theintra prediction mode illustrated in FIG. 30 is set to a value of theintra prediction mode of 18, and the predictive quantization parameteris derived by switching between predictions of the quantizationparameter in accordance with the intra prediction direction using thethreshold TH.

First, it is determined whether or not the converted intra predictiondirection is zero (step S910). The intra prediction direction is zero ina case where an intra prediction according to the average valueprediction is made (Yes in step S910). In such a case, the processproceeds to method1 (step S911). On the other hand, in a case where theintra prediction direction is not zero (No in step S910), it isdetermined whether or not the intra prediction direction is smaller than18 (step S912). In a case where the intra prediction direction issmaller than 18 (Yes in step S912), the process proceeds to method2(step S913). On the other hand, in a case where the intra predictiondirection is larger than or equal to 18 (No in step S912), the processproceeds to method3 (step S914).

First, the process of method1 will be described with reference to FIG.41. The intra prediction direction is determined to be zero (Yes instepS910) in step S910 in a case where an intra prediction according to theaverage value prediction is made. In such a case, any one of the leftneighboring block and the upper neighboring block is not selected withhigher priority, but an average value of the quantization parameters QPLand QPA of the left and upper neighboring blocks is set as thepredictive quantization parameter, and accordingly, first, it isdetermined whether or not both the quantization parameters of the leftand upper neighboring blocks are positive (step S920). In a case whereboth the quantization parameters of the left and upper neighboringblocks are positive (Yes in step S920), the neighboring blocks disposedon both the left side and the upper side are present. Accordingly, byreferring to a neighboring block designated by the direction representedin the intra prediction mode, the quantization parameter can be derived,and, an average value of the quantization parameters QPL and QPA of theleft and upper neighboring blocks is set as a predictive quantizationparameter (step S921).

On the other hand, in a case where both the quantization parameters ofthe left and upper neighboring blocks are not positive (No in stepS920), in other words, in a case where the quantization parameter of atleast one of the left neighboring block and the upper neighboring blockis zero, at least one of the left neighboring block and the upperneighboring block is not present. Thus, an average value of thequantization parameters QPL and QPA of the left and upper neighboringblocks cannot be set as the predictive quantization parameter.Accordingly, based on the presence/no-presence of the left or upperneighboring blocks, in other words, based on whether or not thequantization parameter of the left or upper neighboring block is zero,the quantization parameter that can be taken is set as the predictivequantization parameter.

First, it is determined whether or not the quantization parameter of theupper neighboring block is zero (step S922). In a case where thequantization parameter of the upper neighboring block is not zero (No instep S922), the quantization parameter of the upper neighboring block isset as a predictive quantization parameter (step S923). On the otherhand, in a case where the quantization parameter of the upperneighboring block is zero (Yes in step S922), the quantization parameterof the upper neighboring block cannot be referred to as the predictivequantization parameter, and the process proceeds to the determinationprocess of step S924. Next, it is determined whether or not thequantization parameter of the left neighboring block is zero (stepS924). In a case where the quantization parameter of the leftneighboring block is not zero (No in step S924), the quantizationparameter of the left neighboring block is set as a predictivequantization parameter (step S925). On the other hand, in a case wherethe quantization parameter of the left neighboring block is zero (Yes instep S924), in other words, in a case where both the quantizationparameters of the left and upper neighboring blocks are zero, thequantization parameters of both the blocks are not present, andaccordingly, the quantization parameters of the left and upperneighboring blocks cannot be referred to as the predictive quantizationparameter. Thus, the quantization parameter prevQP of a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set as the predictivequantization parameter (step S926). In addition, in a case where a blockdisposed at the upper left end of the picture is the coding block, theleft and upper neighboring blocks and furthermore a block that isarranged previous to the coding block that is the coding target or hasbeen immediately previously coded are not present, and accordingly, thequantization parameter of the picture or the slice is set as thepredictive quantization parameter.

Next, the process of method2 will be described with reference to FIG.42. In step S912, since it has been determined that the intra predictiondirection is smaller than 18 (Yes in step S912), in order to select thequantization parameter of the upper coded neighboring block as thepredictive quantization parameter, first, it is determined whether ornot the quantization parameter of the upper neighboring block is zero(step S930). In a case where the quantization parameter of the upperneighboring block is not zero (No in step S930), the quantizationparameter of the upper neighboring block is set as a predictivequantization parameter (step S931). On the other hand, in a case wherethe quantization parameter of the upper neighboring block is zero (Yesin step S930), the quantization parameter of the upper neighboring blockcannot be referred to as the predictive quantization parameter, and theprocess proceeds to the determination process of step S932. Next, it isdetermined whether or not the quantization parameter of the leftneighboring block is zero (step S932). In a case where the quantizationparameter of the left neighboring block is not zero (No in step S932),the quantization parameter of the left neighboring block is set as apredictive quantization parameter (step S933). On the other hand, in acase where the quantization parameter of the left neighboring block iszero (Yes in step S932), in other words, in a case where both thequantization parameters of the left and upper neighboring blocks arezero, the quantization parameters of both the blocks are not present,and accordingly, the quantization parameters of the left and upperneighboring blocks cannot be referred to as the predictive quantizationparameter. Thus, the quantization parameter prevQP of a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set as the predictivequantization parameter (step S934). In addition, in a case where a blockdisposed at the upper left end of the picture is the coding block, theleft and upper neighboring blocks and furthermore a block that isarranged previous to the coding block, which is the coding target or hasbeen immediately previously coded are not present, and accordingly, thequantization parameter of the picture or the slice is set as thepredictive quantization parameter.

Subsequently, the process of method3 will be described with reference toFIG. 43. In step S912, since it has been determined that the intraprediction direction is larger than or equal to 18 (No in step S912), inorder to select the quantization parameter of the left coded neighboringblock as the predictive quantization parameter, first, it is determinedwhether or not the quantization parameter of the left neighboring blockis zero (step S940). In a case where the quantization parameter of theleft neighboring block is not zero (No in step S940), the quantizationparameter of the left neighboring block is set as a predictivequantization parameter (step S941). On the other hand, in a case wherethe quantization parameter of the left neighboring block is zero (Yes instep S940), the quantization parameter of the left neighboring blockcannot be referred to as the predictive quantization parameter, and theprocess proceeds to the determination process of step S942. Next, it isdetermined whether or not the quantization parameter of the upperneighboring block is zero (step S942). In a case where the quantizationparameter of the upper neighboring block is not zero (No in step S942),the quantization parameter of the upper neighboring block is set as apredictive quantization parameter (step S943). On the other hand, in acase where the quantization parameter of the upper neighboring block iszero (Yes in step S942), in other words, in a case where both thequantization parameters of the left and upper neighboring blocks arezero, the quantization parameters of both the blocks are not present,and accordingly, the quantization parameters of the left and upperneighboring blocks cannot be referred to as the predictive quantizationparameter. Thus, the quantization parameter prevQP of a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set as the predictivequantization parameter (step S944). In addition, in a case where a blockdisposed at the upper left end of the picture is the coding block, theleft and upper neighboring blocks and furthermore a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded are not present, and accordingly,the quantization parameter of the picture or the slice is set as thepredictive quantization parameter.

In each method branched in the intra prediction direction as above, in acase where the quantization parameter of the neighboring blockdetermined in the intra prediction direction is zero, the quantizationparameter prevQP of a block that is arranged previous to the codingblock, which is the coding target, or has been immediately previouslycoded may be set as the predictive quantization parameter without makinga subsequent determination so as to simplify the determination process.In method1, it is determined whether or not both the quantizationparameters of the left and upper neighboring blocks are positive (stepS920), and, in a case where both the quantization parameters of the leftand upper neighboring blocks are not positive (No in step S920), thequantization parameter prevQP of a block that is arranged previous tothe coding block, which is the coding target, or has been immediatelypreviously coded is set as the predictive quantization parameter (stepS926) without performing a determination process of step S922 andsubsequent steps. In method2, it is determined whether or not thequantization parameter of the upper neighboring block is zero (stepS930), and, in a case where the quantization parameter is zero (Yes instep S930), the quantization parameter prevQP of a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set as the predictivequantization parameter (step S934) without performing the determinationprocess of step S932 and subsequent steps. In method3, it is determinedwhether or not the quantization parameter of the left neighboring blockis zero (step S940), and, in a case where the quantization parameter iszero (Yes in step S940), the quantization parameter prevQP of a blockthat is arranged previous to the coding block, which is the codingtarget, or has been immediately previously coded is set as thepredictive quantization parameter (step S944) without performing thedetermination process of step S942 and subsequent steps.

The predictive quantization parameter derived in this way is supplied tothe differential quantization parameter generation unit 111.

The prediction (step S908) of the quantization parameter that is basedon the intra prediction direction of the eighth example, similarly tothe prediction (step S709) of the quantization parameter that is basedon the intra prediction direction of the sixth example, can be similarlyperformed in a case where the weighting coefficients of the quantizationparameters of the left and upper neighboring blocks are set inaccordance with the prediction direction of the intra prediction mode,as illustrated in FIG. 34, even in a case where the number of thresholdsof the prediction direction of the intra prediction mode is increased,and the weighting coefficients of the quantization parameters of theleft and upper neighboring blocks are set for each range of the area ofthe prediction direction of the intra prediction mode that is delimitedby thresholds. Here, as illustrated in FIG. 34, as an example of a casewhere the number of thresholds of the prediction direction of the intraprediction mode is increased, and the weighting coefficients of thequantization parameters of the left and upper neighboring blocks are setfor each range of the area of the prediction direction of the intraprediction mode delimited by thresholds, a case applied to theprediction (step S908) of the quantization parameter that is based onthe intra prediction direction will be described. The other examplesdescribed in the sixth example can be also applied similarly to a caseto be described below in which the eighth example is applied, and thedescription thereof will not be presented here.

FIG. 44 is a flowchart that illustrates a detailed operation of theprediction (step S908) of the quantization parameter that is based onthe intra prediction direction in a case where, as illustrated in FIG.34, the number of thresholds of the prediction direction of the intraprediction mode is increased, and the weighting coefficients of thequantization parameters of the left and upper neighboring blocks are setfor each range of the area of the prediction direction of the intraprediction mode that is delimited by thresholds. Similarly to the sixthexample, the prediction direction of the intra prediction modeillustrated in FIG. 34 is divided into three areas using thresholds THLOand THHI, the thresholds THLO and THHI are respectively set to 13 and22, and the predictive quantization parameter is derived by switchingbetween predictions of the quantization parameters determined for eacharea in which the intra prediction direction is delimited by thethresholds.

First, it is determined whether or not the converted intra predictiondirection is zero (step S950). The intra prediction direction is zero ina case where an intra prediction according to the average valueprediction is made (Yes in step S950). In such a case the processproceeds to method1 (step S951). On the other hand, in a case where theintra prediction direction is not zero (No in step S950), it isdetermined whether or not the intra prediction direction is smaller thanthe threshold THLO (step S952). In a case where the intra predictiondirection is smaller than the threshold THLO (Yes in step S952), theprocess proceeds to method2 (step S953). On the other hand, in a casewhere the intra prediction direction is larger than or equal to thethreshold THLO (No in step S952), it is determined whether or not theintra prediction direction is smaller than the threshold THHI (stepS954). In a case where the intra prediction direction is not smallerthan the threshold THHI, in other words, in a case where the intraprediction direction is larger than or equal to the threshold THHI (Noin step S954), the process proceeds to method3 (step S955). On the otherhand, in a case where the intra prediction direction is smaller than thethreshold THHI (Yes in step S954), in order to equalize the weighingcoefficients of the quantization parameters of the left and upperneighboring blocks, the process proceeds to step S951.

Next, a detailed operation of method2 (step S953) will be described.FIG. 45 is a flowchart that illustrates the detailed operation ofmethod2 (step S953). In a case where a weighted average is acquired,both the left and upper neighboring blocks need to be present.Accordingly, it is determined whether or not both the quantizationparameters of the left and upper neighboring blocks are positive (stepS960). In a case where both the quantization parameters of the left andupper neighboring blocks are positive (Yes in step S960), theneighboring blocks of both the left and the upper side are present, andaccordingly, the weighting coefficient of the quantization parameter ofthe upper neighboring block is set to be large such that FA>FL>0 (stepS961). For example, FA is set to 3, and FL is set to 1. On the otherhand, in a case where both the quantization parameters of the left andupper neighboring blocks are not positive (No in step S960), in otherwords, in a case where the quantization parameter of at least one of theleft and upper neighboring blocks is zero, at least one of the left andupper neighboring blocks is not present. Accordingly, the weightedaverage cannot be acquired based on the quantization parameters of theleft and upper neighboring blocks, and thus, an acquired quantizationparameter based on the presence/no-presence of the left or upperneighboring block, in other words, based on whether or not thequantization parameter of the left or upper neighboring block is zero isset as the predictive quantization parameter. First, it is determinedwhether or not the quantization parameter of the upper neighboring blockis zero (step S962).

In a case where the quantization parameter of the upper neighboringblock is not zero (No in step S962), in order to set the quantizationparameter of the upper neighboring block as a predictive quantizationparameter, the weighting coefficient FL of the quantization parameter ofthe left neighboring block is set to zero (step S963). For example, FAis set to 4, and FL is set to 0. On the other hand, in a case where thequantization parameter of the left neighboring block is zero (Yes instep S962), the quantization parameter of the upper neighboring blockcannot be referred to as the predictive quantization parameter, andaccordingly, the process proceeds to a determination process of stepS964. Next, it is determined whether or not the quantization parameterof the left neighboring block is zero (step S964). In a case where thequantization parameter of the left neighboring block is not zero (No instep S964), in order to set the quantization parameter of the leftneighboring block as a predictive quantization parameter, the weightingcoefficient FA of the quantization parameter of the upper neighboringblock is set to zero (step S965). For example, FA is set to 4, and FL isset to 0. On the other hand, in a case where the quantization parameterof the left neighboring block is zero (Yes instep S964), in other words,both the quantization parameters of the left and upper neighboringblocks are zero, and both neighboring blocks are not present, andaccordingly, the quantization parameter of the left and right-sideneighboring blocks cannot be referred to as the predictive quantizationparameter. Thus, the quantization parameter prevQP of a block that isarranged previous to the coding block, which is the coding target, orhas been immediately previously coded is set as the predictivequantization parameter (step S967). In a case where the weightingcoefficients of the quantization parameters of the left and upperneighboring blocks are set, the predictive quantization parameter predQPis derived using the following equation based on the determinedweighting coefficients and each quantization parameter (step S966).

$\begin{matrix}{{predQP} = \frac{{{FA} \times {QPA}} + {{FL} \times {QPL}} + 2}{4}} & \left\lbrack {{Expression}\mspace{14mu} 14} \right\rbrack\end{matrix}$

Here, the denominator of the equation represented above is “FA+FL”, and“2” included in the numerator is the value of (FA+FL)/2 that is addedfor rounding off. The predictive quantization parameter derived in thisway is supplied to the differential quantization parameter generationunit 111.

In addition, method1 (step S951) and method3 (step S955) are realized bythe same determination process as that of method2. However, it isnecessary to set the weighting coefficients of the quantizationparameters of the left and upper neighboring blocks in step S961 suchthat “FA=FL≠0” in method1, and “0<FA<FL” in method3.

Here, coefficients other than the combination of the weightingcoefficients FA and FL may be set. However, in a case where thecalculation speed is of significance, variables may be selected suchthat FA+FL is represented as the power of 2. By performing bit shiftingof the deriving equation for the above-described predictive quantizationparameter, the following equation is acquired.

predQP=(FA+QPA+FL×QPL+2)>>2   [Expression 15]

As a combination of the weighting coefficients FA and FL describedabove, in a case where (FA, FL)=(3, 1) is changed to (FA, FL)=(4, 0) anda case where (FA, FL)=(1, 3) is changed to (FA, FL)=(0, 4), the formercase represents the upper neighboring block, and the latter caserepresents the left neighboring block. In such a case, in a case where acalculation process calculating an average value of the quantizationparameters QPA and QPL in the prediction direction of the intraprediction mode positioned between the thresholds THLO and THHI isperformed, and the other average value is not set as the predictivequantization parameter, the process can be realized by only selectingthe quantization parameter of the left or upper neighboring block.Therefore, the process can be simplified and can be performed at highspeed.

In addition, in the eighth example, while the thresholds THLO and THHIare respectively set to 13 and 22 as values of intra predictiondirections, any other values may be used, and the thresholds may beimplicitly set as long as there is no contradiction between the movingpicture coding device 100 and the moving picture decoding device 200.

Furthermore, in the eighth example, while the prediction directions ofthe intra prediction modes are divided into three areas at thethresholds THLO and THHI, the number of the thresholds may be increasedso as to increase the number of divisions. However, in a case where thecalculation speed is of significance, it is preferable to selectvariables as the weighting coefficients FA and FL such that FA+FL isrepresented as the power of 2.

NINTH EXAMPLE

In the sixth and eight examples, there are cases where a neighboringblock determined based on the prediction direction of the intraprediction mode of a coding block that is the coding target is locatedat a position beyond the boundary of the tree block. In the sixthexample, in order to enable the prediction of the quantization parameteraccording to the intra prediction mode, it is determined in advancewhether or not both the left and upper neighboring blocks are located atpositions beyond the boundary of the tree block, and a prediction of thequantization parameter according to the intra prediction mode is madeonly in a case where both the left and upper neighboring blocks are notlocated at positions beyond the boundary of the tree block, but aprediction of the quantization parameter according to the intraprediction mode is not made otherwise (in a case where at least oneneighboring block is located at a position beyond the boundary of thetree block). In the eighth example, in a case where a neighboring blockdetermined in the prediction direction of the intra prediction mode islocated at a position beyond the boundary of the tree block, thequantization parameter of the determined neighboring block cannot beused, and accordingly, it is determined whether the quantizationparameter of another neighboring block or the quantization parameter ofa block that is arranged previous to the coding block, which is thecoding target, or has been immediately previously coded is valid, andthe quantization parameter is derived as the predictive quantizationparameter. As above, in a case where the neighboring block determined inthe prediction direction of the intra prediction mode of the codingblock that is the coding target is located at a position beyond theboundary of the tree block, the prediction direction of the intraprediction mode and the position of the neighboring block that is thereference destination do not coincide with each other, and accordingly,there is concern that the accuracy of the determination according to theintra prediction mode may be degraded. In addition, even in a case wherethe prediction mode of the original coding block is the intraprediction, there are cases where coded neighboring blocks are locatedon the periphery at positions beyond the boundary of the tree block, anda determination according to the intra prediction mode cannot be made.Thus, in the ninth example, in a case where the determination accordingto the intra prediction mode in the second predictive quantizationparameter deriving unit and the position of the neighboring block, whichis referred to, do not coincide with each other, the determinationresult according to the intra prediction mode is not employed, but are-determination is made by the first predictive quantization parameterderiving unit, whereby the accuracy of the prediction of thequantization parameter is improved. While the coding process will bedescribed here, in the case of the decoding process, by paraphrasingcoding with decoding, replacing the predictive quantization parameterderiving unit 114 with the predictive quantization parameter derivingunit 205, replacing the coding information storage memory 113 with thecoding information storage memory 204, and changing the outputdestination of the predictive quantization parameter from thedifferential quantization parameter generation unit 111 to thequantization parameter generation unit 203, an equivalent process isrealized.

A detailed configuration of the predictive quantization parameterderiving units 114 and 205 to which the determination process of theninth example is applied is illustrated in FIG. 46. Each of thepredictive quantization parameter deriving units 114 and 205 isconfigured by: a switch 401; a memory 402; a first predictivequantization parameter deriving unit 403; a second predictivequantization parameter deriving unit 404; and a re-calculationdetermination unit 405. Units of the switch 401 to the first predictivequantization parameter deriving unit 403 illustrated in FIG. 46 have thesame functions as those of the units of the switch 301 to the firstpredictive quantization parameter deriving unit 303 illustrated in FIG.10, and thus the description thereof will not be presented here. Thesecond predictive quantization parameter deriving unit 404 illustratedin FIG. 46 is changed from the above-described second predictivequantization parameter deriving unit 304 illustrated in FIG. 10 to havea different function, and thus, a difference therebetween will bedescribed.

FIG. 47 is a flowchart that illustrates the operation of the secondpredictive quantization parameter deriving unit 404 to which thefunction of the ninth example is applied with respect to the secondpredictive quantization parameter deriving unit 304 described in thesixth example. The process of steps S1000 to S1009 is the same as thatof the second predictive quantization parameter deriving unit 304described above, and the description thereof will not be presented here.A difference from the second predictive quantization parameter derivingunit 304 described above is that it is determined whether or not boththe quantization parameters of the left and upper neighboring blocks arepositive (step S1007), and, in a case where at least one of thequantization parameters of the left and upper neighboring blocks is notpositive (No in step S1007), a prediction of the quantization parameteraccording to the intra prediction mode is not made, and the predictivequantization parameter predQP is set to zero (step S1010). In the secondpredictive quantization parameter deriving unit 304, even when theprediction mode of the coding block is the intra prediction, in a casewhere coded neighboring blocks are located on the periphery at positionsbeyond the boundary of the tree block, the quantization parameters ofthe neighboring blocks are set to zero, and a prediction of thequantization parameter according to the intra prediction mode cannot bemade, the determination is made based on the presence/no-presence ofneighboring blocks regardless of the intra prediction mode. The secondpredictive quantization parameter deriving unit 404 makes only aprediction of the quantization parameter according to the intraprediction mode and, in a case where a determination cannot be made inaccordance with the prediction of the quantization parameter accordingto the intra prediction mode, sets the predictive quantization parameterto zero so as to allow the re-calculation determination unit 405 to bedescribed later to make a determination for the first predictivequantization parameter deriving unit 403 to make a re-determination. Thederived predictive quantization parameter is supplied to there-calculation determination unit 405.

FIG. 48 is a flowchart that illustrates the operation of the secondpredictive quantization parameter deriving unit 404, to which thefunction of the ninth example is applied, for predicting thequantization parameter according to the intra prediction direction withrespect to the prediction (step S908) of the quantization parameteraccording to the intra prediction direction that is made by the secondpredictive quantization parameter deriving unit 304 described in theeighth example. Similarly to the eighth example, the threshold TH of theprediction direction of the intra prediction mode illustrated in FIG. 30is set to a value of the intra prediction mode of 18, and the predictivequantization parameter is derived by switching between predictions ofthe quantization parameter in accordance with the intra predictiondirection based on the threshold TH. First, it is determined whether ornot the converted intra prediction direction is zero (step S1020). Theintra prediction direction is zero in a case where an intra predictionaccording to the average value prediction is made (Yes in step S1020).In such a case, the process proceeds to method1 (step S1021). On theother hand, in a case where the intra prediction direction is not zero(No in step S1020), it is determined whether or not the intra predictiondirection is smaller than 18 (step S1022). In a case where the intraprediction direction is smaller than 18 (Yes in step S1022), the processproceeds to method2 (step S1023). On the other hand, in a case where theintra prediction direction is larger than or equal to 18 (No in stepS1022), the process proceeds to method3 (step S1024).

First, the process of method1 will be described with reference to FIG.49. The intra prediction direction is determined to be zero (Yes in stepS1020) in step S1020 in a case where an intra prediction according tothe average value prediction is made. In such a case, anyone of the leftneighboring block and the upper neighboring block is not selected withhigher priority, but an average value of the quantization parameters QPLand QPA of the left and upper neighboring blocks is set as thepredictive quantization parameter, and accordingly, first, it isdetermined whether or not both the quantization parameters of the leftand upper neighboring blocks are positive (step S1030). In a case whereboth the quantization parameters of the left and upper neighboringblocks are positive (Yes in step S1030), the neighboring blocks disposedon both the left side and the upper side are present. Accordingly, byreferring to a neighboring block designated by the direction representedin the intra prediction mode, the quantization parameter can be derived,and, an average value of the quantization parameters QPL and QPA of theleft and upper neighboring blocks is set as a predictive quantizationparameter (step S1031). On the other hand, in a case where both thequantization parameters of the left and upper neighboring blocks are notpositive (No in step S1030), in other words, in a case where thequantization parameter of at least one of the left neighboring block andthe upper neighboring block is zero, at least one of the leftneighboring block and the upper neighboring block is not present. Thus,an average value of the quantization parameters QPL and QPA of the leftand upper neighboring blocks cannot be set as the predictivequantization parameter, and thus the predictive quantization parameteris set to zero (step S1032).

Next, the process of method2 will be described with reference to FIG.50. In step S1022, since it has been determined that the intraprediction direction is smaller than 18 (Yes in step S1022), in order toselect the quantization parameter of the upper coded neighboring blockas the predictive quantization parameter, first, it is determinedwhether or not the quantization parameter of the upper neighboring blockis zero (step S1040). In a case where the quantization parameter of theupper neighboring block is not zero (No in step S1040), the quantizationparameter of the upper neighboring block is set as a predictivequantization parameter (step S1041). On the other hand, in a case wherethe quantization parameter of the upper neighboring block is zero (Yesin step S1040), the quantization parameter of the upper neighboringblock cannot be referred to as the predictive quantization parameter,and the predictive quantization parameter is set to zero (step S1042).

Subsequently, the process of method3 will be described with reference toFIG. 51. In step S1022, since it has been determined that the intraprediction direction is larger than or equal to 18 (No in step S1022),in order to select the quantization parameter of the left codedneighboring block as the predictive quantization parameter, first, it isdetermined whether or not the quantization parameter of the leftneighboring block is zero (step S1050). In a case where the quantizationparameter of the left neighboring block is not zero (No in step S1050),the quantization parameter of the left neighboring block is set as apredictive quantization parameter (step S1051). On the other hand, in acase where the quantization parameter of the left neighboring block iszero (Yes in step S1050), the quantization parameter of the leftneighboring block cannot be referred to as the predictive quantizationparameter, and thus, the predictive quantization parameter is set tozero (step S1052).

As above, in each method branched in the intra prediction direction, ina case where the neighboring block is located at a position beyond theboundary of the tree block or outside the screen, the quantizationparameter of the neighboring block determined in the intra predictiondirection is zero, and the predictive quantization parameter cannot bederived based on the quantization parameter of the neighboring blockdetermined in the intra prediction direction. Thus, in order torepresent that a determination cannot be made in the prediction of thequantization parameter according to the intra prediction mode, thepredictive quantization parameter is set to zero. The derived predictivequantization parameter is supplied to the re-calculation determinationunit 405.

In this way, the predictive quantization parameter predQP derived by thesecond predictive quantization parameter deriving unit 404 is suppliedto the re-calculation determination unit 405.

A detailed operation of the re-calculation determination unit 405 willbe described with reference to FIG. 52. The predictive quantizationparameter is supplied to the re-calculation determination unit 405 fromthe second predictive quantization parameter deriving unit 404 (stepS1100). The re-calculation determination unit 405 determines whether ornot the supplied predictive quantization parameter is zero (step S1101).In a case where the predictive quantization parameter is zero, it isregarded that an appropriate determination result cannot be acquired bythe second predictive quantization parameter deriving unit 404, and thefirst predictive quantization parameter deriving unit 403 is urged toderive the predictive quantization parameter again (step S1102). On theother hand, in a case where the predictive quantization parameter is notzero, the predictive quantization parameter derived by the secondpredictive quantization parameter deriving unit 404 is supplied to thedifferential quantization parameter generation unit 111.

As above, in a case where the determination according to the intraprediction mode in the second predictive quantization parameter derivingunit and the position of the neighboring block, which is referred to, donot coincide with each other, the determination result according to theintra prediction mode is not employed, but a re-determination can bemade by the first predictive quantization parameter deriving unit.

In the ninth example, except that the determination result according tothe intra prediction mode is not employed, but the predictivequantization parameter is output as zero in a case where thedetermination according to the intra prediction mode in the secondpredictive quantization parameter deriving unit 404 and the position ofthe neighboring block, which is referred to, do not coincide with eachother, there is no change from the prediction determination of thequantization parameter according to the intra prediction mode of thesecond predictive quantization parameter deriving unit 304 of the sixthand eighth example. Accordingly, in the sixth example, in a case wherethe weighting coefficients of the quantization parameters of the leftand upper neighboring blocks are set in accordance with the predictiondirection of the intra prediction mode, as illustrated in FIG. 34, evenin a case where the number of thresholds of the prediction direction ofthe intra prediction mode is increased, and the weighting coefficientsof the quantization parameters of the left and upper neighboring blocksare set for each range of the area of the prediction direction of theintra prediction mode delimited by thresholds, the process of the ninthexample can be similarly performed, and the description thereof will notbe presented here.

According to the moving picture coding device of the embodiment, thequantization parameter coded for each block of the coding target ispredicted using the quantization parameters of coded blocks disposed onthe periphery, an optimal predictive quantization parameter is derived,and a difference between the quantization parameter and the predictivequantization parameter is taken and is coded. Accordingly, the codingamount of the quantization parameters is reduced without changing thepicture quality, whereby the coding efficiency can be improved.

In addition, the quantization parameter prediction function can be builton the coding side and the decoding side as a common function, wherebythe circuit scale can be reduced. This is achieved by realizing thedetermination of the prediction of quantization parameters so as not togenerate a contradiction between the coding side and the decoding sidesuch that a coded neighboring block is formed as a block that is locallydecoded for the prediction of the next coding block on the coding sideand is the same as the decoded block.

In the description presented above, while the quantization parameter ispredicted in units of coding blocks, when the number of divisions insidethe tree block is increased, and many coding blocks having a small blocksize are generated, the coding amount per coding block in the codingamount control is too small, and there are cases where the quantizationparameter is not appropriately calculated. In addition, the storedamounts in the coding information storage memories 113 and 204 of themoving picture coding device 100 and the moving picture decoding device200 storing coding information of quantization parameters at the time ofcoding and decoding are increased. Thus, by newly setting a block calleda quantization group as a unit for coding and transmitting thequantization parameter, the quantization parameter may be predicted inunits of these blocks.

The quantization group is a group that is determined in accordance withthe size of the tree block, and the size is represented by a valueacquired by multiplying the length of the side of the block of the treeblock by ½^(n) (here, n is an integer that is larger than or equal tozero). In other words, a value acquired by shifting the length of theside of the block of the tree block to the right side by n bits is thelength of the side of the quantization group. This value, similarly tothe tree block structure, determines the block size and accordingly hashigh affinity to the tree block. In addition, since the inside of thetree block is divided into parts having the equal size, the quantizationparameter stored in the coding information storage memory 113 and 204can be managed and read in a simple manner.

FIG. 53 is a diagram that illustrates an example in which the inside ofthe tree block is divided into a tree block structure. The block size ofthe tree block is 64×64, and the inside of the tree block ofhierarchically divided four times. In accordance with the firstdivision, the tree block is divided into 32×32 blocks (dotted-linerectangles illustrated in FIG. 53). In addition, in accordance with thesecond division, the tree block is divided into 16×16 blocks (hatchedrectangles illustrated in FIG. 53). Furthermore, in accordance with thethird division, the tree block is divided into 8×8 blocks (whiterectangles illustrated in FIG. 53) of coding blocks. Here, when thequantization group is set as a 16×16 rectangle block, the quantizationgroup is represented by a thick dotted line illustrated in FIG. 53, andthe quantization parameter is predicted in units of quantization groups.

In a case where the coding block that is the coding target is largerthan the block size of the quantization group (32×32 block), forexample, the inside of the coding block represented by a stipplerectangle illustrated in FIG. 53 is divided into four quantizationgroups. While the coding block is divided into four quantization groups,there is one quantization parameter of this coding block. Accordingly,in a case where the size of the coding block is larger than thequantization group, a differential quantization parameter after theprediction of the quantization parameter of the coding block is codedand transmitted, and the same quantization parameter is stored in memoryareas of the coding information storage memories 113 and 204 thatrespectively correspond to the divided four quantization groups. Whilethe quantization parameters are redundant inside the memory, it is easyto access the quantization parameter of a neighboring coded blockdisposed on the periphery in the prediction of the quantizationparameter.

On the other hand, in a case where the coding block that is the codingtarget has the same size as the block size of the quantization group(16×16 block), the process is the same as that in the case of theprediction of the quantization parameter in units of coding blocksdescribed above.

In a case where the coding block that is the coding target is smallerthan the block size of the quantization group (8×8 block), for example,in the case of a coding block represented by a white rectangleillustrated in FIG. 53, four coding blocks are housed in thequantization group. Accordingly, each coding block included in thequantization group does not include a quantization parameter, but onequantization parameter is included inside the quantization group, andeach coding block is coded using the quantization parameter. Inaddition, there is a method in which one representative value isselected from among quantization parameters of four coding blocksdisposed inside the quantization group as the quantization parameter ofthe quantization group, a method in which an average value of thequantization parameters is calculated, and the like. However, thepresent invention is not limited thereto.

FIG. 54 illustrates an example of a prediction of a quantizationparameter in a case where the coding block has a size smaller than theblock size of the quantization group. In FIG. 54, a hatched rectanglerepresents a coding block that is the coding target, a gray rectanglerepresents a coded block used for the prediction of the quantizationparameter by the quantization group including the coding block, and athin solid-line represents the coding process sequence. The predictionof the quantization parameter is performed with the position of thepixel of the upper left corner of the quantization group that is theprocessing target used as the reference. In a case where thequantization parameter of a coded block neighboring to the upper side isused for the prediction, for the hatched rectangle illustrated in FIG.54, the position of the coded block including a pixel neighboring to onepixel that is the pixel of the upper left corner of the quantizationgroup including the coding block that is the coding target iscalculated, and a quantization parameter stored at an address thatcorresponds to the position is read from the coding information storagememories 113 and 204. Similarly, in a case where the quantizationparameter of a coded block neighboring to the left side is used, theposition of the coded block including a pixel neighboring to the pixeldisposed on the upper left corner of the quantization group includingthe coding block, which is the coding target, on the left side with onepixel being separate therefrom is calculated, and a quantizationparameter recorded at an address that corresponds to the position isread from the coding information storage memories 113 and 204. In a casewhere the coded block including pixels neighboring to the left side andthe upper side of the pixel disposed on the upper left corner of thequantization group including the coding block that is the coding targetis beyond the boundary of the tree block, the quantization parameter ofa coded block that is arranged previous to the coding block, which isthe coding target, or has been immediately previously coded is used.Accordingly, an address of the memory at the time of storing thequantization parameter in the coding information storage memories 113and 204 in the coding process is temporarily stored, and thequantization parameter stored at an address corresponding to theposition that is arranged previous to the coding block, which is thecoding target, or is an immediately previous position is read from thecoding information storage memories 113 and 204. In this way, thequantization parameter of the coding block that is the coding target canbe predicted.

As above, the prediction of the quantization parameter in units ofquantization groups can be performed similarly to the above-describedprediction of the quantization parameter in units of coding blocks.

In addition, the block size of the quantization group may be directlydescribed in the header information of a bitstream, or a bit shiftamount that represents ½^(n) times (here, n is an integer that is largerthan or equal to zero) of the tree block size may be described. Forexample, a prediction of the quantization parameter in units of picturesis made, and inside the header information of a picture, a flagcu_qp_delta_enable_flag used for designating whether or not adifferential quantization parameter is transmitted with being describedin the bitstream is defined and, only in a case where the flagcu_qp_delta_enable_flag is set to be valid (set to “1”), a parameterdiff_cu_qp_delta_depth used for determining the size of the quantizationgroup is described in the bitstream. In a case where the size of thetree block is represented by 2^(n), the size of the quantization groupis represented as the power of 2 having a value acquired by subtractingthe parameter diff_cu_qp_delta_depth from the exponent n as theexponent. In addition, particularly, the block size may not be describedin the bitstream, but the size of the quantization group may beexplicitly determined in the coding process and the decoding process.

The bitstream of a moving picture output by the moving picture codingdevice according to the embodiment described above has a specific dataformat so as to be decoded in accordance with the coding method used inthe embodiment, and accordingly, the moving picture decoding devicecorresponding to the moving picture coding device can decode thebitstream of the specific data format.

In a case where a wired or wireless network is used for exchanging abitstream between the moving picture coding device and the movingpicture decoding device, the bitstream may be converted into a dataformat that is appropriate for the transmission form in a communicationpath and be transmitted. In such a case, a moving picture receptiondevice is disposed, which converts a bitstream output by the movingpicture coding device into coding data of a data format that isappropriate to the transmission form in the communication path, receivesthe coding data from a moving picture transmission device that transmitsthe coding data to the network and the network, restores the bitstreamfrom the coding data, and supplies the restored bitstream to the movingpicture decoding device.

The moving picture transmission device includes: a memory that buffers abitstream output by the moving picture coding device; a packetprocessing unit that packetizes the bitstream;

and a transmission unit that transmits packetized coding data through anetwork. The moving picture reception device includes: a reception unitthat receives packetized coding data through a network; a memory thatbuffers the received coding data; and a packet processing unit thatgenerates a bitstream by performing a packet process of coding data andsupplies the generated bitstream to the moving picture decoding device.

The processes relating to the coding and decoding described above may berealized not only as a transmission/storage/reception device usinghardware but also by firmware stored in a read only memory (ROM), aflash memory, or the like or software of a computer or the like. Thefirmware or the software program may be provided with being recorded ina recording medium that can be read by a computer or the like, may beprovided from a server through a wired or wireless network, or may beprovided as data broadcasting of satellite digital broadcasting.

As above, the present invention has been described based on theembodiments. However, such embodiments are merely examples, and it isunderstood to a person skilled in the art that various modifications maybe made in each constituent element thereof or a combination of eachprocess sequence, and such modified examples also belong to the scope ofthe present invention.

[Item 1] There is provided a moving picture coding device that furtherdivides a first block acquired by dividing each picture of a movingpicture into a predetermined size into one or a plurality of secondblocks and codes the moving picture in units of blocks. The movingpicture coding device includes:

a quantization parameter calculation unit configured to calculate aquantization parameter of the second block;

a predictive quantization parameter deriving unit configured to derive apredictive quantization parameter of the second block by using thequantization parameter of one or a plurality of third blocks that areneighboring to the second block;

a differential quantization parameter generation unit configured togenerate a differential quantization parameter of the second block basedon a difference between the quantization parameter and the predictivequantization parameter of the second block; and

a coding unit configured to code the differential quantization parameterof the second block,

wherein the predictive quantization parameter deriving unit derives thepredictive quantization parameter of the second block by using aquantization parameter of a fourth block coded before the second blockin a case where the third block neighboring to the second block islocated at a position beyond a boundary of the first block.

[Item 2] The moving picture coding device described in Item 1, whereinthe predictive quantization parameter deriving unit derives thequantization parameter of a fifth block neighboring to the left side ofthe second block out of the third blocks as the predictive quantizationparameter in a case where a sixth block neighboring to the upper side ofthe second block out of the third blocks is located at a position beyondthe boundary of the first block and derives the predictive quantizationparameter based on the quantization parameters of the fifth block andthe sixth block in a case where the sixth block is located at a positionnot beyond the boundary of the first block.

[Item 3] The moving picture coding device described in Item 1, whereinthe predictive quantization parameter deriving unit derives thepredictive quantization parameter based on quantization parameters of afifth block and a sixth block in a case where both the fifth blockneighboring to the left side of the second block and the sixth blockneighboring to the upper side of the second block out of the thirdblocks are located at positions not beyond the boundary of the firstblock, derives the predictive quantization parameter by using thequantization parameter of the fourth block coded before the second blockinstead of the quantization parameter of a neighboring block located ata position beyond the boundary and the quantization parameter of aneighboring block located at a position not beyond the boundary in acase where the one neighboring block out of the fifth block and thesixth block is located at the position beyond the boundary of the firstblock, and derives the quantization parameter of the fourth block codedbefore the second block as the predictive quantization parameter in acase where both the fifth block and the sixth block are located atpositions beyond the boundary of the first block.

[Item 4] The moving picture coding device described in Item 1, whereinthe predictive quantization parameter deriving unit derives thequantization parameter of the fourth block coded before the second blockout of the third blocks as the predictive quantization parameter in acase where the fifth block neighboring to the left side of the secondblock out of the third blocks is located at a position beyond theboundary of the first block and derives the quantization parameter ofthe fifth block as the predictive quantization parameter in a case wherethe fifth block is located at a position not beyond the boundary of thefirst block.

[Item 5] The moving picture coding device described in any one of Items1 to 4, wherein size information of the second block is described withina bitstream.

[Item 6] There is provided a moving picture coding device that codes amoving picture by using a motion-compensated prediction in units ofcoding blocks that are acquired by further dividing a block acquired bydividing each picture of the moving picture into a predetermined sizeinto one or a plurality of coding blocks. The moving picture codingdevice includes:

a quantization parameter calculation unit configured to calculate aquantization parameter of the coding block;

a predictive quantization parameter deriving unit configured to derive apredictive quantization parameter of the coding block by using thequantization parameter of a coded neighboring block neighboring to thecoding block in accordance with a prediction mode of themotion-compensated prediction of the coding block;

a differential quantization parameter generation unit configured togenerate a differential quantization parameter of the coding block basedon a difference between the quantization parameter and the predictivequantization parameter of the coding block; and

a coding unit configured to code the differential quantization parameterof the coding block,

wherein predictive quantization parameter deriving unit, in a case wherea neighboring block neighboring to the coding block in a predetermineddirection is located at a position beyond a boundary of the block of thepredetermined size, derives the predictive quantization parameter of thecoding block by using the quantization parameter of another coded blockother than the neighboring block neighboring in the predetermineddirection.

[Item 7] There is provided a moving picture coding method for furtherdividing a first block acquired by dividing each picture of a movingpicture into a predetermined size into one or a plurality of secondblocks and coding the moving picture in units of blocks, the movingpicture coding method includes:

calculating a quantization parameter of the second block;

deriving a predictive quantization parameter of the second block byusing the quantization parameter of one or a plurality of third blocksthat are neighboring to the second block;

generating a differential quantization parameter of the second blockbased on a difference between the quantization parameter and thepredictive quantization parameter of the second block; and

coding the differential quantization parameter of the second block,

wherein, in the deriving of a predictive quantization parameter, thepredictive quantization parameter of the second block is derived byusing a quantization parameter of a fourth block coded before the secondblock in a case where the third block neighboring to the second block islocated at a position beyond a boundary of the first block.

[Item 8] There is provided a moving picture coding program for furtherdividing a first block acquired by dividing each picture of a movingpicture into a predetermined size into one or a plurality of secondblocks and coding the moving picture in units of blocks, the movingpicture coding program causes a computer to perform:

calculating a quantization parameter of the second block;

deriving a predictive quantization parameter of the second block byusing the quantization parameter of one or a plurality of third blocksthat are neighboring to the second block;

generating a differential quantization parameter of the second blockbased on a difference between the quantization parameter and thepredictive quantization parameter of the second block; and

coding the differential quantization parameter of the second block,

wherein, in the deriving of a predictive quantization parameter, thepredictive quantization parameter of the second block is derived byusing a quantization parameter of a fourth block coded before the secondblock in a case where the third block neighboring to the second block islocated at a position beyond a boundary of the first block.

[Item 9] There is provided a moving picture decoding device that furtherdivides a first block acquired by dividing each picture of a movingpicture into a predetermined size into one or a plurality of secondblocks and decodes a bitstream in which the moving picture is coded, themoving picture decoding device including:

a decoding unit configured to extract a differential quantizationparameter of the second block by decoding the bitstream;

a predictive quantization parameter deriving unit configured to derive apredictive quantization parameter of the second block by using thequantization parameter of one or a plurality of third blocks neighboringto the second block; and

a quantization parameter generation unit configured to generate aquantization parameter of the second block by adding the differentialquantization parameter and the predictive quantization parameter of thesecond block,

wherein the predictive quantization parameter deriving unit derives thepredictive quantization parameter of the second block by using aquantization parameter of a fourth block decoded before the second blockin a case where the third block neighboring to the second block islocated at a position beyond a boundary of the first block.

[Item 10] The moving picture decoding device described in Item 9,wherein the predictive quantization parameter deriving unit derives thequantization parameter of a fifth block neighboring to the left side ofthe second block out of the third blocks as the predictive quantizationparameter in a case where a sixth block neighboring to the upper side ofthe second block out of the third blocks is located at a position beyondthe boundary of the first block and derives the predictive quantizationparameter based on the quantization parameters of the fifth block andthe sixth block in a case where the sixth block is located at a positionnot beyond the boundary of the first block.

[Item 11] The moving picture decoding device described in Item 9,wherein the predictive quantization parameter deriving unit derives thepredictive quantization parameter based on quantization parameters of afifth block and a sixth block in a case where both the fifth blockneighboring to the left side of the second block and the sixth blockneighboring to the upper side of the second block out of the thirdblocks are located at positions not beyond the boundary of the firstblock, derives the predictive quantization parameter by using thequantization parameter of the fourth block decoded before the secondblock instead of the quantization parameter of a neighboring blocklocated at a position beyond the boundary and the quantization parameterof a neighboring block located at a position not beyond the boundary ina case where the one neighboring block out of the fifth block and thesixth block is located at the position beyond the boundary of the firstblock, and derives the quantization parameter of the fourth blockdecoded before the second block as the predictive quantization parameterin a case where both the fifth block and the sixth block are located atpositions beyond the boundary of the first block.

[Item 12] The moving picture decoding device described in Item 9,wherein the predictive quantization parameter deriving unit derives thequantization parameter of the fourth block decoded before the secondblock out of the third blocks as the predictive quantization parameterin a case where the fifth block neighboring to the left side of thesecond block out of the third blocks is located at a position beyond theboundary of the first block and derives the quantization parameter ofthe fifth block as the predictive quantization parameter in a case wherethe fifth block is located at a position not beyond the boundary of thefirst block.

[Item 13] The moving picture decoding device described in any one ofItems 9 to 12, wherein size information of the second block is extractedfrom the bitstream and is set as the size of the second block.

[Item 14] A moving picture decoding device that further divides a blockacquired by dividing each picture of a moving picture into apredetermined size into one or a plurality of coding blocks and decodesa bitstream in which the moving picture is coded in units of codingblocks, the moving picture decoding device including:

a decoding unit configured to extract a differential quantizationparameter of the decoding block by decoding the bitstream in units ofdecoding blocks;

a predictive quantization parameter deriving unit configured to derive apredictive quantization parameter of the decoding block by using thequantization parameter of a decoded neighboring block neighboring to thedecoding block in accordance with a prediction mode of themotion-compensated prediction of the decoding block; and

a quantization parameter generation unit configured to generate aquantization parameter of the decoding block by adding the differentialquantization parameter and the predictive quantization parameter of thedecoding block,

wherein the predictive quantization parameter deriving unit derives thepredictive quantization parameter of the decoding block by using aquantization parameter of another decoded block other than theneighboring block neighboring in the predetermined direction in a casewhere the neighboring block neighboring in the predetermined directionof the decoding block is located at a position beyond the boundary ofthe block of the predetermined size.

[Item 15] A moving picture decoding method for further dividing a firstblock acquired by dividing each picture of a moving picture into apredetermined size into one or a plurality of second blocks and decodinga bitstream in which the moving picture is coded, the moving picturedecoding method including:

extracting a differential quantization parameter of the second block bydecoding the bitstream;

deriving a predictive quantization parameter of the second block byusing the quantization parameter of one or a plurality of third blocksneighboring to the second block; and

generating a quantization parameter of the second block by adding thedifferential quantization parameter and the predictive quantizationparameter of the second block, wherein

in the deriving of a predictive quantization parameter, the predictivequantization parameter of the second block is derived by using aquantization parameter of a fourth block decoded before the second blockin a case where the third block neighboring to the second block islocated at a position beyond a boundary of the first block, and

in the deriving of a predictive quantization parameter, the predictivequantization parameter is derived based on quantization parameters of afifth block and a sixth block in a case where both the fifth blockneighboring to the left side of the second block and the sixth blockneighboring to the upper side of the second block out of the thirdblocks are located at positions not beyond the boundary of the firstblock, the predictive quantization parameter is derived by using thequantization parameter of the fourth block decoded before the secondblock instead of the quantization parameter of a neighboring blocklocated at a position beyond the boundary and the quantization parameterof a neighboring block located at a position not beyond the boundary ina case where the one neighboring block out of the fifth block and thesixth block is located at the position beyond the boundary of the firstblock, and the quantization parameter of the fourth block decoded beforethe second block is derived as the predictive quantization parameter ina case where both the fifth block and the sixth block are located atpositions beyond the boundary of the first block.

[Item 16] There is provided a moving picture decoding program forfurther dividing a first block acquired by dividing each picture of amoving picture into a predetermined size into one or a plurality ofsecond blocks and decoding a bitstream in which the moving picture iscoded, the moving picture decoding program causing a computer toperform:

extracting a differential quantization parameter of the second block bydecoding the bitstream;

deriving a predictive quantization parameter of the second block byusing the quantization parameter of one or a plurality of third blocksneighboring to the second block; and

generating a quantization parameter of the second block by adding thedifferential quantization parameter and the predictive quantizationparameter of the second block,

wherein, in the deriving of a predictive quantization parameter, thepredictive quantization parameter of the second block is derived byusing a quantization parameter of a fourth block decoded before thesecond block in a case where the third block neighboring to the secondblock is located at a position beyond a boundary of the first block.

What is claimed is:
 1. A moving picture coding device that codes movingpictures in units of a block by partitioning a first block, which isobtained by partitioning each picture of the moving pictures intopredetermined sizes, into one or a plurality of second blocks, thedevice comprising: a quantization parameter calculation unit configuredto calculate a quantization parameter of the second block; a predictivequantization parameter deriving unit configured to derive a predictivequantization parameter of the second block using quantization parametersof a third block adjacent to the left of the second block and a fourthblock adjacent to the top of the second block; a differentialquantization parameter generation unit configured to generate adifferential quantization parameter of the second block from adifference between the quantization parameter of the second block andthe predictive quantization parameter of the second block; and a codingunit configured to code the differential quantization parameter of thesecond block, wherein the predictive quantization parameter derivingunit sets the quantization parameter of the third block as a firstquantization parameter when the third block is at a position not beyonda boundary of the first block, sets a quantization parameter of a fifthblock coded before the second block as the first quantization parameterwhen the third block is at a position beyond the boundary of the firstblock so as to set the first quantization parameter having a non-zerovalue regardless of the position for the boundary of the first block,sets the quantization parameter of the fourth block as a secondquantization parameter when the fourth block is at a position not beyondthe boundary of the first block, sets the quantization parameter of thefifth block as the second quantization parameter when the fourth blockis at a position beyond the boundary of the first block so as to set thesecond quantization parameter having a non-zero value regardless of theposition for the boundary of the first block, and derives an average ofthe first and second quantization parameters as the predictivequantization parameter of the second block regardless of the position ofthe third block or the fourth block, or both the third and fourthblocks, with respect to the boundary of the first block.
 2. A movingpicture coding method of coding moving pictures in units of a block bypartitioning a first block, which is obtained by partitioning eachpicture of the moving pictures into predetermined sizes, into one or aplurality of second blocks, the method comprising: a quantizationparameter calculation step of calculating a quantization parameter ofthe second block; a predictive quantization parameter deriving step ofderiving a predictive quantization parameter of the second block usingquantization parameters of a third block adjacent to the left of thesecond block and a fourth block adjacent to the top of the second block;a differential quantization parameter generation step of generating adifferential quantization parameter of the second block from adifference between the quantization parameter of the second block andthe predictive quantization parameter of the second block; and a codingstep of coding the differential quantization parameter of the secondblock, wherein in the predictive quantization parameter deriving step,the quantization parameter of the third block is set as a firstquantization parameter when the third block is at a position not beyonda boundary of the first block, a quantization parameter of a fifth blockdecoded before the second block is set as the first quantizationparameter when the third block is at a position beyond the boundary ofthe first block so as to set the first quantization parameter having anon-zero value regardless of the position for the boundary of the firstblock, the quantization parameter of the fourth block is set as a secondquantization parameter when the fourth block is at a position not beyondthe boundary of the first block, the quantization parameter of the fifthblock is set as the second quantization parameter when the fourth blockis at a position beyond the boundary of the first block so as to set thesecond quantization parameter having a non-zero value regardless of theposition for the boundary of the first block, and an average of thefirst and second quantization parameters as the predictive quantizationparameter of the second block is derived regardless of the position ofthe third block or the fourth block, or both the third and fourthblocks, with respect to the boundary of the first block.
 3. A recordingmedium having a moving picture coding program for coding moving picturesin units of a block by partitioning a first block, which is obtained bypartitioning each picture of the moving pictures into predeterminedsizes, into one or a plurality of second blocks, the program causing acomputer to execute: a quantization parameter calculation step ofcalculating a quantization parameter of the second block; a predictivequantization parameter deriving step of deriving a predictivequantization parameter of the second block using quantization parametersof a third block adjacent to the left of the second block and a fourthblock adjacent to the top of the second block; a differentialquantization parameter generation step of generating a differentialquantization parameter of the second block from a difference between thequantization parameter of the second block and the predictivequantization parameter of the second block; and a coding step of codingthe differential quantization parameter of the second block, wherein inthe predictive quantization parameter deriving step, the quantizationparameter of the third block is set as a first quantization parameterwhen the third block is at a position not beyond a boundary of the firstblock, a quantization parameter of a fifth block decoded before thesecond block is set as the first quantization parameter when the thirdblock is at a position beyond the boundary of the first block so as toset the first quantization parameter having a non-zero value regardlessof the position for the boundary of the first block, the quantizationparameter of the fourth block is set as a second quantization parameterwhen the fourth block is at a position not beyond the boundary of thefirst block, the quantization parameter of the fifth block is set as thesecond quantization parameter when the fourth block is at a positionbeyond the boundary of the first block so as to set the secondquantization parameter having a non-zero value regardless of theposition for the boundary of the first block, and an average of thefirst and second quantization parameters as the predictive quantizationparameter of the second block is derived regardless of the position ofthe third block or the fourth block, or both the third and fourthblocks, with respect to the boundary of the first block.